Penalty methods for computing points that satisfy second order necessary conditions. - Alfred Auslender (Math. Program., 1979)

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

Global Regularity Theorems. - Alfred Auslender; Jean-Pierre Crouzeix (Math. Oper. Res., 1988)

A Comparative Study of Multifunction Differentiability with Applications in Mathematical Programming. - Alfred Auslender; Roberto Cominetti (Math. Oper. Res., 1991)

Convex Functions with Unbounded Level Sets and Applications to Duality Theory. - Alfred Auslender; Roberto Cominetti; Jean-Pierre Crouzeix (SIAM J. Optim., 1993)

An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities. - Alfred Auslender; Mounir Haddou (Math. Program., 1995)

Noncoercive Optimization Problems. - Alfred Auslender (Math. Oper. Res., 1996)

Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming. - Alfred Auslender; Roberto Cominetti; Mounir Haddou (Math. Oper. Res., 1997)

How to deal with the unbounded in optimization: Theory and algorithms. - Alfred Auslender (Math. Program., 1997)

A Logarithmic-Quadratic Proximal Method for Variational Inequalities. - Alfred Auslender; Marc Teboulle; Sami Ben-Tiba (Comput. Optim. Appl., 1999)

Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels. - Alfred Auslender; Marc Teboulle; Sami Ben-Tiba (Math. Oper. Res., 1999)

Penalty and Barrier Methods: A Unified Framework. - Alfred Auslender (SIAM J. Optim., 1999)

Primal and Dual Stability Results for Variational Inequalities. - Alfred Auslender; Rafael Correa (Comput. Optim. Appl., 2000)

Existence of optimal solutions and duality results under weak conditions. - Alfred Auslender (Math. Program., 2000)

Lagrangian Duality and Related Multiplier Methods for Variational Inequality Problems. - Alfred Auslender; Marc Teboulle (SIAM J. Optim., 2000)

Entropic proximal decomposition methods for convex programs and variational inequalities. - Alfred Auslender; Marc Teboulle (Math. Program., 2001)

Variational inequalities over the cone of semidefinite positive symmetric matrices and over the Lorentz cone. - Alfred Auslender (Optim. Methods Softw., 2003)

Interior Gradient and Epsilon-Subgradient Descent Methods for Constrained Convex Minimization. - Alfred Auslender; Marc Teboulle (Math. Oper. Res., 2004)

Interior projection-like methods for monotone variational inequalities. - Alfred Auslender; Marc Teboulle (Math. Program., 2005)

Penalty and Barrier Methods for Convex Semidefinite Programming. - Alfred Auslender; Héctor Ramírez Cabrera (Math. Methods Oper. Res., 2006)

Interior Gradient and Proximal Methods for Convex and Conic Optimization. - Alfred Auslender; Marc Teboulle (SIAM J. Optim., 2006)

Nonmonotone projected gradient methods based on barrier and Euclidean distances. - Alfred Auslender; Paulo J. S. Silva; Marc Teboulle (Comput. Optim. Appl., 2007)

Penalty and Smoothing Methods for Convex Semi-Infinite Programming. - Alfred Auslender; Miguel A. Goberna; Marco A. López 001 (Math. Oper. Res., 2009)

Projected subgradient methods with non-Euclidean distances for non-differentiable convex minimization and variational inequalities. - Alfred Auslender; Marc Teboulle (Math. Program., 2009)

Computing Points that Satisfy Second Order Necessary Optimality Conditions for Unconstrained Minimization. - Alfred Auslender (SIAM J. Optim., 2010)

A Moving Balls Approximation Method for a Class of Smooth Constrained Minimization Problems. - Alfred Auslender; Ron Shefi; Marc Teboulle (SIAM J. Optim., 2010)

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

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

Comparative study of RPSALG algorithm for convex semi-infinite programming. - Alfred Auslender; Alberto Ferrer 002; Miguel A. Goberna; Marco A. López 001 (Comput. Optim. Appl., 2015)

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