On the convergence of the exponential multiplier method for convex programming

DOI10.1007/BF01580598zbMath0783.90101MaRDI QIDQ688911

Paul Tseng, Dimitri P. Bertsekas

Publication date: 1 November 1993

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

augmented Lagrangianentropy minimizationconvex constrained minimizationexponential method of multipliers

Mathematics Subject Classification ID

Convex programming (90C25) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Exponential augmented Lagrangian methods for equilibrium problems, A characterization of the optimal set of linear programs based on the augmented lagrangian, Unified theory of augmented Lagrangian methods for constrained global optimization, Some properties of generalized proximal point methods for quadratic and linear programming, Decomposition Methods Based on Augmented Lagrangians: A Survey, Global convergence of a smooth approximation method for mathematical programs with complementarity constraints, Nonlinear rescaling and proximal-like methods in convex optimization, Nonlinear rescaling as interior quadratic prox method in convex optimization, On the twice differentiable cubic augmented Lagrangian, Characterizations of stability of error bounds for convex inequality constraint systems, On the entropic perturbation and exponential penalty methods for linear programming, Exponential penalty function formulation for multilevel optimization using the analytical target cascading framework, Solving Inverse Problems by Joint Posterior Maximization with Autoencoding Prior, Saddle point and exact penalty representation for generalized proximal Lagrangians, An entropy-like proximal algorithm and the exponential multiplier method for convex symmetric cone programming, A simple smooth exact penalty function for smooth optimization problem, The Legendre Transformation in Modern Optimization, A second-order convergence augmented Lagrangian method using non-quadratic penalty functions, Dislocation hyperbolic augmented Lagrangian algorithm for nonconvex optimization, Rescaled proximal methods for linearly constrained convex problems, A new exact exponential penalty function method and nonconvex mathematical programming, An augmented Lagrangian algorithm for solving semiinfinite programming, An entire space polynomial-time algorithm for linear programming, A new class of exact penalty functions and penalty algorithms, Existence of local saddle points for a new augmented Lagrangian function, Unnamed Item, Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming, Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming, Augmented Lagrangian applied to convex quadratic problems, On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems, Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems, Vector exponential penalty function method for nondifferentiable multiobjective programming problems, A geometric framework for nonconvex optimization duality using augmented Lagrangian functions, Mechanical design problems with unilateral contact, Regularized Lotka-Volterra dynamical system as continuous proximal-like method in optimization., Lagrangian regularization approach to constrained optimization problems, A new family of penalties for augmented Lagrangian methods, On the convergence properties of modified augmented Lagrangian methods for mathematical programming with complementarity constraints, Smooth convex approximation to the maximum eigenvalue function, Intensity modulated radiotherapy treatment planning by use of a barrier-penalty multiplier method, Convergence properties of modified and partially-augmented Lagrangian methods for mathematical programs with complementarity constraints, Space-decomposition multiplier method for constrained minimization problems, A proximal point algorithm with a ϕ-divergence for quasiconvex programming, Dual convergence of the proximal point method with Bregman distances for linear programming, Augmented Lagrangian functions for cone constrained optimization: the existence of global saddle points and exact penalty property, Double-regularization proximal methods, with complementarity applications, Convergence analysis of modified \(p\)th power Lagrangian algorithms with alternative updating strategies for constrained nonconvex optimization, Generalized Proximal Distances for Bilevel Equilibrium Problems, The global convergence of augmented Lagrangian methods based on NCP function in constrained nonconvex optimization, Primal–dual exterior point method for convex optimization, A class of exact penalty functions and penalty algorithms for nonsmooth constrained optimization problems, Regularized smoothing approximations to vertical nonlinear complementarity problems, On the convergence of the entropy-exponential penalty trajectories and generalized proximal point methods in semidefinite optimization, A new duality theory for mathematical programming, A variable-penalty alternating directions method for convex optimization, Perturbation analysis of a condition number for convex inequality systems and global error bounds for analytic systems, Zero duality and saddle points of a class of augmented Lagrangian functions in constrained non-convex optimization, Dual Space Preconditioning for Gradient Descent, An exterior point polynomial-time algorithm for convex quadratic programming, Lagrangian transformation and interior ellipsoid methods in convex optimization, Nonlinear separation in the image space with applications to penalty methods, On the finite termination of an entropy function based non-interior continuation method for vertical linear complementarity problems, Penalty/Barrier multiplier algorthm for semidefinit programming^∗, Convergence results of an augmented Lagrangian method using the exponential penalty function, Entropy function-based algorithms for solving a class of nonconvex minimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proximal minimization algorithm with \(D\)-functions
• Bounds for error in the solution set of a perturbed linear program
• Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
• Asymptotic Convergence Analysis of the Proximal Point Algorithm
• A Generalization of the Proximal Point Algorithm
• Optimal short-term scheduling of large-scale power systems
• Necessary and sufficient conditions for a penalty method to be exact
• Monotone Operators and the Proximal Point Algorithm
• Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
• Lipschitz Continuity of Solutions of Linear Inequalities, Programs and Complementarity Problems
• A dual approach to solving nonlinear programming problems by unconstrained optimization
• Convex Analysis