Recherche - Institut Camille Jordan Accéder directement au contenu

Filtrer vos résultats

7 résultats
Page :
triés par

An extended sequential quadratically constrained quadratic programming algorithm for nonlinear, semidefinite, and second-order cone programming

 Alfred Auslender
Journal of Optimization Theory and Applications, 2013, 156 (2), pp.183-212
Article dans une revue hal-00965611v1

A proximal extension of the column generation method to nonconvex conic optimization providing bounds for the duality gap

 Alfred Auslender
Journal of Convex Analysis, 2010, 17 (3-4), pp.721-736
Article dans une revue hal-00965636v1

A very simple {SQCQP} method for a class of smooth convex constrained minimization problems with nice convergence results

 Alfred Auslender
Mathematical Programming, 2013, 142 (1-2, Ser. A), pp.349-369
Article dans une revue hal-00965603v1

Computing points that satisfy second order necessary optimality conditions for unconstrained minimization

 Alfred Auslender
SIAM Journal on Optimization, 2010, 20 (4), pp.1868-1884
Article dans une revue hal-00965641v1

Projected subgradient methods with non-{E}uclidean distances for non-differentiable convex minimization and variational inequalities

 Alfred Auslender , Marc Teboulle
Mathematical Programming, 2009, 120 (1, Ser. B), pp.27-48
Article dans une revue hal-00965710v1

A moving balls approximation method for a class of smooth constrained minimization problems

 Alfred Auslender , Ron Shefi , Marc Teboulle
SIAM Journal on Optimization, 2010, 20 (6), pp.3232-3259
Article dans une revue hal-00965630v1

Penalty and Smoothing Methods for Convex Semi-Infinite Programming

 Alfred Auslender , Miguel A. Goberna , Marco A. López
Mathematics of Operations Research, 2009, 34 (2), pp.303-319. ⟨10.1287/moor.1080.0362⟩
Article dans une revue hal-00704915v1
Page :