On the method of multipliers for mathematical programming problems

DOI10.1007/BF00934960zbMath0236.90063OpenAlexW2030409788MaRDI QIDQ2552449

G. M. Coggins, P. E. Moseley, A. V. Levy, Angelo Miele

Publication date: 1972

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

Full work available at URL: https://doi.org/10.1007/bf00934960

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (30)

A class of augmented Lagrangians for equality constraints in nonlinear programming problems ⋮ Interior-point Lagrangian decomposition method for separable convex optimization ⋮ Decomposition Methods Based on Augmented Lagrangians: A Survey ⋮ Multi-stage Monte Carlo and non-linear test problems ⋮ Partly convex programming and Zermelo's navigation problems ⋮ A continuous implementation of a second-variation optimal control method for space trajectory problems ⋮ Augmentability in optimization theory ⋮ Performance of several nonlinear programming software packages on microcomputers. ⋮ Multiplier method and optimal control problems with terminal state constraints ⋮ The behaviour of optimal Lyapunov functions ⋮ COSMO: a conic operator splitting method for convex conic problems ⋮ Biased penalty function algorithms for optimal control problems with terminal restraints ⋮ Approximate greatest descent methods for optimization with equality constraints ⋮ On the combination of the multiplier method of Hestenes and Powell with Newton's method ⋮ Multiplier methods: A survey ⋮ Diagonalized multiplier methods and quasi-Newton methods for constrained optimization ⋮ Minimization methods with constraints ⋮ Accelerated convergence for the Powell/Hestenes multiplier method ⋮ Augmented Lagrangian Objective Penalty Function ⋮ A second-order method for the general nonlinear programming problem ⋮ Local convergence of the diagonalized method of multipliers ⋮ A geometric method in nonlinear programming ⋮ Dynamic programming and penalty functions ⋮ Perturbation lemma for the Newton method with application to the SQP Newton method ⋮ The multiplier method of Hestenes and Powell applied to convex programming ⋮ Alternating direction splittings for block angular parallel optimization ⋮ Convergence and duality for the multiplier and penalty methods ⋮ Nonmonotone and monotone active-set method for image restoration. I: Convergence analysis. ⋮ The role of the multipliers in the multiplier method ⋮ A dual approach to solving nonlinear programming problems by unconstrained optimization

Cites Work

• Sequential gradient-restoration algorithm for the minimization of constrained functions. Ordinary and conjugate gradient versions
• Constrained optimization problems using multiplier methods
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the method of multipliers for mathematical programming problems