On the method of multipliers for convex programming

DOI10.1109/TAC.1975.1100976MaRDI QIDQ4056628zbMATH OpenFDO

Authors Dimitri P. Bertsekas

Publication date 1975

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TAC.1975.1100976

Mathematics Subject Classification ID

Convex programming (90C25) Methods of successive quadratic programming type (90C55)

Cited in

(10)

• Multiplier methods: A survey
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• A second-order method for the general nonlinear programming problem
• Convexification procedures and decomposition methods for nonconvex optimization problems
• Efficient management of interconnected power systems: A game-theoretic approach
• Semidefinite inverse eigenvalue problems with prescribed entries and partial eigendata
• Decomposition methods based on augmented Lagrangians: a survey
• Multisymplectic variational integrators for nonsmooth Lagrangian continuum mechanics
• The augmented Lagrangian method for a type of inverse quadratic programming problems over second-order cones
• Proximal algorithms and temporal difference methods for solving fixed point problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4056628)