Auslender A.

A. Auslender

Information about the author A. Auslender will soon be added to the site.
Found 7 papers in total
Interior gradient and epsilon-subgradient descent methods for constrained convex minimization
Interior gradient and epsilon-subgradient descent methods for constrained convex minimization
2004
We extend epsilon-subgradient descent methods for unconstrained nonsmooth convex...
Noncoercive optimization problems
Noncoercive optimization problems
1996
This paper modifies a recent sufficient condition for the existence of optimal...
Asymptotic analysis for penalty and barrier methods in convex and linear programming
Asymptotic analysis for penalty and barrier methods in convex and linear programming
1997
We consider a wide class of penalty and barrier methods for convex programming which...
Entropic proximal decomposition methods for convex programs and variational inequalities
Entropic proximal decomposition methods for convex programs and variational inequalities
2001
We consider convex optimization and variational inequality problems with a given...
Existence of optimal solutions and duality results under weak conditions
Existence of optimal solutions and duality results under weak conditions
2000
In this paper we consider an ordinary convex program with no qualification conditions...
How to deal with the unbounded in optimization: Theory and algorithms
How to deal with the unbounded in optimization: Theory and algorithms
1997
The aim of this survey is to show how the unbounded arises in optimization problems...
A comparative study of multifunction differentiability with applications in mathematical programming
A comparative study of multifunction differentiability with applications in mathematical programming
1991
A unified treatment of various notions of tangency for sets and differentiability for...
Papers per page: