Combined Primal–Dual and Penalty Methods for Convex Programming

DOI10.1137/0314020zbMath0332.90035OpenAlexW2074292837MaRDI QIDQ4099842

Barry W. Kort, Dimitri P. Bertsekas

Publication date: 1976

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

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

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Rate of convergence, degree of approximation (41A25)

Related Items (29)

Duality in nonlinear programs using augmented Lagrangian functions ⋮ Proximal point method and elliptic regularization ⋮ Decomposition Methods Based on Augmented Lagrangians: A Survey ⋮ Error bounds in mathematical programming ⋮ On the twice differentiable cubic augmented Lagrangian ⋮ Some numerical experience with a globally convergent algorithm for nonlinearly constrained optimization ⋮ Dislocation hyperbolic augmented Lagrangian algorithm for nonconvex optimization ⋮ Characterizations of the nonemptiness and compactness for solution sets of convex set-valued optimization problems ⋮ New algorithmic alternatives for the O--D matrix adjustment problem on traffic networks ⋮ Penalty function methods and a duality gap for invex optimization problems ⋮ Necessary and sufficient conditions for a penalty method to be exact ⋮ On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators ⋮ Numerical comparison of augmented Lagrangian algorithms for nonconvex problems ⋮ INEXACT VERSIONS OF PROXIMAL POINT AND AUGMENTED LAGRANGIAN ALGORITHMS IN BANACH SPACES ⋮ Multiplier methods: A survey ⋮ A multiplier method with automatic limitation of penalty growth ⋮ Augmented Lagrangian methods for variational inequality problems ⋮ A dual algorithm for the solution of nonlinear variational problems via finite element approximation ⋮ Accelerated convergence for the Powell/Hestenes multiplier method ⋮ Convergence analysis of modified \(p\)th power Lagrangian algorithms with alternative updating strategies for constrained nonconvex optimization ⋮ Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints ⋮ Convexification procedures and decomposition methods for nonconvex optimization problems ⋮ The global convergence of augmented Lagrangian methods based on NCP function in constrained nonconvex optimization ⋮ Augmented Lagrangian methods for nonlinear programming with possible infeasibility ⋮ Convergence analysis of a proximal newton method¹ ⋮ Delaunay-based derivative-free optimization via global surrogates. III: nonconvex constraints ⋮ Funciones penalidad y lagrangianos aumentados ⋮ Error bounds and convergence analysis of feasible descent methods: A general approach ⋮ On Degenerate Doubly Nonnegative Projection Problems

This page was built for publication: Combined Primal–Dual and Penalty Methods for Convex Programming