Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming
From MaRDI portal
Publication:4339372
DOI10.1287/moor.22.1.43zbMath0872.90067OpenAlexW2011243226MaRDI QIDQ4339372
Alfred Auslender, Mounir Haddou, Roberto Cominetti
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
Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05)
Related Items (43)
On the central paths in symmetric cone programming ⋮ Strict convex regularizations, proximal points and augmented lagrangians ⋮ A nonlinear Lagrangian based on Fischer-Burmeister NCP function ⋮ How to deal with the unbounded in optimization: Theory and algorithms ⋮ Nonlinear rescaling as interior quadratic prox method in convex optimization ⋮ A new approach for solving nonlinear algebraic systems with complementarity conditions. Application to compositional multiphase equilibrium problems ⋮ Penalty and barrier methods for convex semidefinite programming ⋮ On a smoothed penalty-based algorithm for global optimization ⋮ Global convergence of a class new smooth penalty algorithm for constrained optimization problem ⋮ Global convergence of a class of smooth penalty methods for semi-infinite programming ⋮ On the convergence of a smooth penalty algorithm without computing global solutions ⋮ The Legendre Transformation in Modern Optimization ⋮ Enhanced computation of the proximity operator for perspective functions ⋮ Characterizations of the nonemptiness and compactness for solution sets of convex set-valued optimization problems ⋮ Dual convergence for penalty algorithms in convex programming ⋮ Modified Lagrangian methods for separable optimization problems ⋮ A CLASS OF NONLINEAR LAGRANGIANS: THEORY AND ALGORITHM ⋮ General primal-dual penalty/barrier path-following Newton methods for nonlinear programming ⋮ Second-order multiplier iteration based on a class of nonlinear Lagrangians ⋮ Calmness of partially perturbed linear systems with an application to the central path ⋮ Simulated annealing with asymptotic convergence for nonlinear constrained optimization ⋮ On some properties and an application of the logarithmic barrier method ⋮ Hybrid extragradient proximal algorithm coupled with parametric approximation and penalty/barrier methods ⋮ Smoothing methods for nonlinear complementarity problems ⋮ A geometric framework for nonconvex optimization duality using augmented Lagrangian functions ⋮ Nonlinear rescaling Lagrangians for nonconvex semidefinite programming ⋮ Embedding equality constraints of optimization problems into a quantum annealer ⋮ A class of nonlinear Lagrangians for nonconvex second order cone programming ⋮ Global convergence and finite termination of a class of smooth penalty function algorithms ⋮ Lagrangian regularization approach to constrained optimization problems ⋮ Primal-dual nonlinear rescaling method with dynamic scaling parameter update ⋮ Penalty functions with a small penalty parameter ⋮ Smoothing approximation to \(l_1\) exact penalty function for inequality constrained optimization ⋮ Smoothing Nonlinear Penalty Functions for Constrained Optimization Problems ⋮ Examples of ill-behaved central paths in convex optimization ⋮ Characterizations of nonemptiness and compactness of the set of weakly efficient solutions for convex vector optimization and applications ⋮ An approximate penalty method with descent for convex optimization problems ⋮ Primal–dual exterior point method for convex optimization ⋮ On smoothing exact penalty functions for nonlinear constrained optimization problems ⋮ On the Convergence of Mirror Descent beyond Stochastic Convex Programming ⋮ Dual Space Preconditioning for Gradient Descent ⋮ Lp approximation of variational problems in L1 and L∞ ⋮ Optimal planning of a multi-station system with sojourn time constraints
This page was built for publication: Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming
