Penalty/Barrier Multiplier Methods for Convex Programming Problems

DOI10.1137/S1052623493259215zbMath0872.90068OpenAlexW2001473319MaRDI QIDQ4340799

Aharon Ben-Tal, Michael Zibulevsky

Publication date: 12 June 1997

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s1052623493259215

zbMATH Keywords

convergencestructural optimizationpenalty functionnonquadratic augmented Lagrangians

Mathematics Subject Classification ID

Convex programming (90C25) Applications of mathematical programming (90C90) Optimization problems in solid mechanics (74P99)

Related Items (48)

A nonlinear Lagrangian based on Fischer-Burmeister NCP function ⋮ Unified theory of augmented Lagrangian methods for constrained global optimization ⋮ An self-adaptive LQP method for constrained variational inequalities ⋮ Decomposition Methods Based on Augmented Lagrangians: A Survey ⋮ The control of drilling vibrations: a coupled PDE-ODE modeling approach ⋮ Free material optimization via mathematical programming ⋮ Nonlinear rescaling as interior quadratic prox method in convex optimization ⋮ Penalty and barrier methods for convex semidefinite programming ⋮ Global asymptotic stabilisation of rational dynamical systems based on solving BMI ⋮ Augmented Lagrangian method with alternating constraints for nonlinear optimization problems ⋮ The Legendre Transformation in Modern Optimization ⋮ A second-order convergence augmented Lagrangian method using non-quadratic penalty functions ⋮ A variance-expected compliance model for structural optimization ⋮ Non-rigid Shape Correspondence Using Surface Descriptors and Metric Structures in the Spectral Domain ⋮ Modified Lagrangian methods for separable optimization problems ⋮ Minimization of the expected compliance as an alternative approach to multiload truss optimization ⋮ Review of formulations for structural and mechanical system optimization ⋮ A CLASS OF NONLINEAR LAGRANGIANS: THEORY AND ALGORITHM ⋮ Existence of local saddle points for a new augmented Lagrangian function ⋮ Second-order multiplier iteration based on a class of nonlinear Lagrangians ⋮ Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming ⋮ A primal-dual modified log-barrier method for inequality constrained nonlinear optimization ⋮ Blind Source Separation by Sparse Decomposition in a Signal Dictionary ⋮ Combined SVM-based feature selection and classification ⋮ Coordinate and subspace optimization methods for linear least squares with non-quadratic regularization ⋮ Exact augmented Lagrangian duality for mixed integer linear programming ⋮ Some convex programs without a duality gap ⋮ Nonlinear rescaling Lagrangians for nonconvex semidefinite programming ⋮ Mechanical design problems with unilateral contact ⋮ A class of nonlinear Lagrangians for nonconvex second order cone programming ⋮ Combined SVM-based feature selection and classification ⋮ Numerical comparison of augmented Lagrangian algorithms for nonconvex problems ⋮ Primal-dual nonlinear rescaling method with dynamic scaling parameter update ⋮ Proximal methods for nonlinear programming: Double regularization and inexact subproblems ⋮ A new family of penalties for augmented Lagrangian methods ⋮ On using exterior penalty approaches for solving linear programming problems ⋮ Intensity modulated radiotherapy treatment planning by use of a barrier-penalty multiplier method ⋮ Space-decomposition multiplier method for constrained minimization problems ⋮ Local convergence of an augmented Lagrangian method for matrix inequality constrained programming ⋮ Constraint incorporation in optimization ⋮ Lagrangian penalization scheme with parallel forward-backward splitting ⋮ Optimal Call Admission Control for an IEEE 802.16 Wireless Metropolitan Area Network ⋮ On Barrier and Modified Barrier Multigrid Methods for Three-Dimensional Topology Optimization ⋮ Primal–dual exterior point method for convex optimization ⋮ A New Nonlinear Lagrangian Method for Nonconvex Semidefinite Programming ⋮ Robust solutions of uncertain linear programs ⋮ Lagrangian transformation and interior ellipsoid methods in convex optimization ⋮ Penalty/Barrier multiplier algorthm for semidefinit programming^∗

This page was built for publication: Penalty/Barrier Multiplier Methods for Convex Programming Problems