The multiplier method of Hestenes and Powell applied to convex programming

DOI10.1007/BF00934777zbMath0254.90045MaRDI QIDQ2558160

R. Tyrrell Rockafellar

Publication date: 1973

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (only showing first 100 items - show all)

A matrix-free augmented Lagrangian algorithm with application to large-scale structural design optimization ⋮ The use of Lyapunov's second method to estimate regions of stability and attraction ⋮ Randomized shortest paths with net flows and capacity constraints ⋮ On the convergence properties of a second-order augmented Lagrangian method for nonlinear programming problems with inequality constraints ⋮ A sparse nonlinear optimization algorithm ⋮ A class of augmented Lagrangians for equality constraints in nonlinear programming problems ⋮ A nonlinear Lagrangian based on Fischer-Burmeister NCP function ⋮ Dual techniques for constrained optimization ⋮ On the best achievable quality of limit points of augmented Lagrangian schemes ⋮ Perturbed augmented Lagrangian method framework with applications to proximal and smoothed variants ⋮ An efficient augmented Lagrangian method with applications to total variation minimization ⋮ Zero duality gap for a class of nonconvex optimization problems ⋮ Moreau envelope augmented Lagrangian method for nonconvex optimization with linear constraints ⋮ Decomposition Methods Based on Augmented Lagrangians: A Survey ⋮ Minimax estimation for singular linear multivariate models with mixed uncertainty ⋮ Convexity of the implicit Lagrangian ⋮ Solution of thin film magnetization problems in type-II superconductivity ⋮ A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems ⋮ Estimation of parameter functions in ordinary differential equations with a stage structure: a linear case ⋮ An augmented Lagrangian trust region method for equality constrained optimization ⋮ An alternating direction method for total variation denoising ⋮ Separable approximations and decomposition methods for the augmented Lagrangian ⋮ Design of biased random walks on a graph with application to collaborative recommendation ⋮ An augmented Lagrangian based semismooth Newton method for a class of bilinear programming problems ⋮ Convergence analysis of the augmented Lagrangian method for nonlinear second-order cone optimization problems ⋮ Augmentability in optimization theory ⋮ Noise model based \(\nu\)-support vector regression with its application to short-term wind speed forecasting ⋮ A proximal augmented Lagrangian method for equilibrium problems ⋮ An alternating direction and projection algorithm for structure-enforced matrix factorization ⋮ Solving Lagrangian variational inequalities with applications to stochastic programming ⋮ A genetic algorithm based augmented Lagrangian method for constrained optimization ⋮ The rate of convergence of proximal method of multipliers for equality constrained optimization problems ⋮ An implementable augmented Lagrange method for solving fixed point problems with coupled constraints ⋮ Regularization methods for optimization problems with probabilistic constraints ⋮ A two-level distributed algorithm for nonconvex constrained optimization ⋮ A review of optimization of structures subjected to transient loads ⋮ The augmented Lagrangian method for equality and inequality constraints in Hilbert spaces ⋮ A class of infinite dimensional linear programming problems ⋮ The augmented Lagrangian method for a type of inverse quadratic programming problems over second-order cones ⋮ Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming ⋮ The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming ⋮ A topology optimization method based on the level set method incorporating a fictitious interface energy ⋮ A sequential quadratically constrained quadratic programming method with an augmented Lagrangian line search function ⋮ The over-relaxed proximal point algorithm based on \(H\)-maximal monotonicity design and applications ⋮ Augmented Lagrangian methods under the constant positive linear dependence constraint qualification ⋮ Three-dimensional topology optimization of a fluid-structure system using body-fitted mesh adaption based on the level-set method ⋮ Parameterized level-set based topology optimization method considering symmetry and pattern repetition constraints ⋮ A truly variationally consistent and symmetric mortar-based contact formulation for finite deformation solid mechanics ⋮ Level set based shape optimization using trimmed hexahedral meshes ⋮ An alternating direction method for nonnegative solutions of the matrix equation \(AX+YB=C\) ⋮ Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization ⋮ An alternating direction algorithm for matrix completion with nonnegative factors ⋮ A topology optimization method based on the level set method for the design of negative permeability dielectric metamaterials ⋮ Nondifferentiable optimization via smooth approximation: General analytical approach ⋮ A primal-dual regularized interior-point method for convex quadratic programs ⋮ A class of nonlinear Lagrangians for nonconvex second order cone programming ⋮ A simple and feasible method for a class of large-scale \(l^1\)-problems ⋮ Numerical comparison of augmented Lagrangian algorithms for nonconvex problems ⋮ INEXACT VERSIONS OF PROXIMAL POINT AND AUGMENTED LAGRANGIAN ALGORITHMS IN BANACH SPACES ⋮ On the combination of the multiplier method of Hestenes and Powell with Newton's method ⋮ An augmented Lagrangian fish swarm based method for global optimization ⋮ Quadratic multiplier method convergence ⋮ Multiplier methods: A survey ⋮ On a characterization of convergence for the Hestenes method of multipliers ⋮ Diagonalized multiplier methods and quasi-Newton methods for constrained optimization ⋮ Approximation procedures based on the method of multipliers ⋮ Minimization methods with constraints ⋮ A dual algorithm for the solution of nonlinear variational problems via finite element approximation ⋮ An augmented Lagrangian method for a class of Inverse quadratic programming problems ⋮ Partial inverse of a monotone operator ⋮ A second-order method for the general nonlinear programming problem ⋮ Topology optimization using the lattice Boltzmann method incorporating level set boundary expressions ⋮ A nonlinear Lagrangian for constrained optimization problems ⋮ Convexification procedures and decomposition methods for nonconvex optimization problems ⋮ An augmented Lagrangian ant colony based method for constrained optimization ⋮ One modification of the logarithmic barrier function method in linear and convex programming ⋮ The global convergence of augmented Lagrangian methods based on NCP function in constrained nonconvex optimization ⋮ A geometric method in nonlinear programming ⋮ Lagrange optimality system for a class of nonsmooth convex optimization ⋮ Value-estimation function method for constrained global optimization ⋮ Convergence of the augmented Lagrangian method for nonlinear optimization problems over second-order cones ⋮ Dynamic programming and penalty functions ⋮ Log-sigmoid nonlinear Lagrange method for nonlinear optimization problems over second-order cones ⋮ Augmented Lagrangian method for second-order cone programs under second-order sufficiency ⋮ General proximal point algorithm involving \(\eta \)-maximal accretiveness framework in Banach spaces ⋮ A variable-penalty alternating directions method for convex optimization ⋮ A primal-proximal heuristic applied to the French unit-commitment problem ⋮ Unified convergence analysis of a second-order method of multipliers for nonlinear conic programming ⋮ Decomposition for structured convex programs with smooth multiplier methods ⋮ Johri's general dual, the Lagrangian dual, and the surrogate dual ⋮ Local analysis of a new multipliers method ⋮ A primal-dual projection method for solving systems of linear inequalities ⋮ The role of the multipliers in the multiplier method ⋮ The adventures of a simple algorithm ⋮ A convergence analysis of a nonlinear Lagrange algorithm for general nonlinear constrained optimization problems ⋮ Augmented Lagrangian algorithms for linear programming ⋮ Extended convergence results for the method of multipliers for nonstrictly binding inequality constraints ⋮ Analysis and implementation of a dual algorithm for constrained optimization ⋮ Nonlinear complementarity as unconstrained and constrained minimization ⋮ Hyperspectral unmixing by the alternating direction method of multipliers

Cites Work

• Unnamed Item
• Multiplier and gradient methods
• Use of the augmented penalty function in mathematical programming problems. I
• On the method of multipliers for mathematical programming problems
• Systems of Inequalities Involving Convex Functions
• A general saddle point result for constrained optimization
• A dual approach to solving nonlinear programming problems by unconstrained optimization
• Convex Analysis

This page was built for publication: The multiplier method of Hestenes and Powell applied to convex programming