Multiplier methods: A survey
type: Item
instance of: scholarly article
title: Multiplier methods: A survey
zbMATH Open document ID: 0321.49027
DOI: 10.1016/0005-1098(76)90077-7
author: Dimitri P. Bertsekas
published in: Automatica
publication date: 1976-01-01T00:00:00Z
Mathematics Subject Classification ID: 49M30
Mathematics Subject Classification ID: 49-02
zbMATH DE Number: 3502283
MaRDI profile type: Publication
full work available at URL: 0005-1098(76)90077-7
OpenAlex ID: W368078881
cites work: A general saddle point result for constrained optimization
cites work: Q3266142
cites work: On Penalty and Multiplier Methods for Constrained Minimization
cites work: Q4085503
cites work: On the method of multipliers for convex programming
cites work: Combined Primal-Dual and Penalty Methods for Constrained Minimization
cites work: Necessary and sufficient conditions for a penalty method to be exact
cites work: Q4101754
cites work: Approximation procedures based on the method of multipliers
cites work: The auction algorithm: A distributed relaxation method for the assignment problem
cites work: A new method for the optimization of a nonlinear function subject to nonlinear constraints
cites work: Difference Approximations in Optimal Control Problems
cites work: Perturbations of Optimal Control Problems
cites work: Discrete Approximations to Continuous Optimal Control Problems
cites work: An explicit procedure for discretizing continuous, optimal control problems
cites work: Finite-Dimensional Approximations of State-Constrained Continuous Optimal Control Problems
cites work: On the convergence of a numerical method for optimal control problems
cites work: Q5588268
cites work: Q4099846
cites work: Q5675557
cites work: Q4404037
cites work: Q4085502
cites work: Multiplier and gradient methods
cites work: Combined Primal–Dual and Penalty Methods for Convex Programming
cites work: Q4120311
cites work: An Adaptive Precision Gradient Method for Optimal Control
cites work: An approach to nonlinear programming
cites work: Q5630824
cites work: Q5566063
cites work: Unconstrained Lagrangians in Nonlinear Programming
cites work: Q4109503
cites work: A new approach to constrained function optimization
cites work: On the method of multipliers for mathematical programming problems
cites work: Q5686600
cites work: Use of the augmented penalty function in mathematical programming problems. I
cites work: Use of the augmented penalty function in mathematical programming problems. II. Conjugate gradient-restoration algorithm
cites work: A quadratically convergent primal-dual algorithm with global convergence properties for solving optimization problems with equality constraints
cites work: Multiplier method and optimal control problems with terminal state constraints
cites work: Balance function for the optimal control problem
cites work: Q5672476
cites work: The method of penalty estimates for conditional extremum problems
cites work: Q4358709
cites work: Q5593503
cites work: GP -- a C language implementation of genetic programming
cites work: Q5621277
cites work: Q5639522
cites work: A dual approach to solving nonlinear programming problems by unconstrained optimization
cites work: The multiplier method of Hestenes and Powell applied to convex programming
cites work: Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
cites work: Q3908772
cites work: Q5638112
cites work: Approximation of the classical isoperimetric problem
cites work: A method for solving a quadratic optimal control problems
cites work: A Nonlinear Optimal Control Minimization Technique
cites work: Constrained optimization problems using multiplier methods
cites work: Q5635266
cites work: Q5591247
description: scientific article; zbMATH DE number 3502283