Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming
From MaRDI portal
Publication:4339372
DOI10.1287/moor.22.1.43zbMath0872.90067MaRDI QIDQ4339372
Alfred Auslender, Roberto Cominetti, Mounir Haddou
Publication date: 26 October 1997
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.22.1.43
90C25: Convex programming
90C31: Sensitivity, stability, parametric optimization
90C05: Linear programming
Related Items
Penalty functions with a small penalty parameter, Smoothing Nonlinear Penalty Functions for Constrained Optimization Problems, Strict convex regularizations, proximal points and augmented lagrangians, Primal–dual exterior point method for convex optimization, Characterizations of nonemptiness and compactness of the set of weakly efficient solutions for convex vector optimization and applications, Lagrangian regularization approach to constrained optimization problems, Optimal planning of a multi-station system with sojourn time constraints, Nonlinear rescaling as interior quadratic prox method in convex optimization, Penalty and barrier methods for convex semidefinite programming, Simulated annealing with asymptotic convergence for nonlinear constrained optimization, On smoothing exact penalty functions for nonlinear constrained optimization problems, How to deal with the unbounded in optimization: Theory and algorithms, Examples of ill-behaved central paths in convex optimization, A nonlinear Lagrangian based on Fischer-Burmeister NCP function, On some properties and an application of the logarithmic barrier method, A geometric framework for nonconvex optimization duality using augmented Lagrangian functions, Primal-dual nonlinear rescaling method with dynamic scaling parameter update, A CLASS OF NONLINEAR LAGRANGIANS: THEORY AND ALGORITHM, General primal-dual penalty/barrier path-following Newton methods for nonlinear programming, Lp approximation of variational problems in L1 and L∞
