Alfred Auslender

According to our database1, Alfred Auslender authored at least 30 papers between 1979 and 2015.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2015
An Exact Penalty Method for Nonconvex Problems Covering, in Particular, Nonlinear Programming, Semidefinite Programming, and Second-Order Cone Programming.
SIAM J. Optim., 2015

Comparative study of RPSALG algorithm for convex semi-infinite programming.
Comput. Optim. Appl., 2015

2013
A very simple SQCQP method for a class of smooth convex constrained minimization problems with nice convergence results.
Math. Program., 2013

An Extended Sequential Quadratically Constrained Quadratic Programming Algorithm for Nonlinear, Semidefinite, and Second-Order Cone Programming.
J. Optim. Theory Appl., 2013

2010
A Moving Balls Approximation Method for a Class of Smooth Constrained Minimization Problems.
SIAM J. Optim., 2010

Computing Points that Satisfy Second Order Necessary Optimality Conditions for Unconstrained Minimization.
SIAM J. Optim., 2010

2009
Projected subgradient methods with non-Euclidean distances for non-differentiable convex minimization and variational inequalities.
Math. Program., 2009

Penalty and Smoothing Methods for Convex Semi-Infinite Programming.
Math. Oper. Res., 2009

2007
Nonmonotone projected gradient methods based on barrier and Euclidean distances.
Comput. Optim. Appl., 2007

2006
Interior Gradient and Proximal Methods for Convex and Conic Optimization.
SIAM J. Optim., 2006

Penalty and Barrier Methods for Convex Semidefinite Programming.
Math. Methods Oper. Res., 2006

2005
Interior projection-like methods for monotone variational inequalities.
Math. Program., 2005

2004
Interior Gradient and Epsilon-Subgradient Descent Methods for Constrained Convex Minimization.
Math. Oper. Res., 2004

2003
Variational inequalities over the cone of semidefinite positive symmetric matrices and over the Lorentz cone.
Optim. Methods Softw., 2003

2001
Entropic proximal decomposition methods for convex programs and variational inequalities.
Math. Program., 2001

2000
Lagrangian Duality and Related Multiplier Methods for Variational Inequality Problems.
SIAM J. Optim., 2000

Existence of optimal solutions and duality results under weak conditions.
Math. Program., 2000

Primal and Dual Stability Results for Variational Inequalities.
Comput. Optim. Appl., 2000

1999
Penalty and Barrier Methods: A Unified Framework.
SIAM J. Optim., 1999

Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels.
Math. Oper. Res., 1999

A Logarithmic-Quadratic Proximal Method for Variational Inequalities.
Comput. Optim. Appl., 1999

1997
How to deal with the unbounded in optimization: Theory and algorithms.
Math. Program., 1997

Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming.
Math. Oper. Res., 1997

1996
Noncoercive Optimization Problems.
Math. Oper. Res., 1996

1995
An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities.
Math. Program., 1995

1993
Convex Functions with Unbounded Level Sets and Applications to Duality Theory.
SIAM J. Optim., 1993

1991
A Comparative Study of Multifunction Differentiability with Applications in Mathematical Programming.
Math. Oper. Res., 1991

1988
Global Regularity Theorems.
Math. Oper. Res., 1988

1982
On the differential properties of the support function of the ∈-subdifferential of a convex function.
Math. Program., 1982

1979
Penalty methods for computing points that satisfy second order necessary conditions.
Math. Program., 1979


  Loading...