Approximation procedures based on the method of multipliers

DOI10.1007/BF00933293zbMath0346.90046OpenAlexW1968309115MaRDI QIDQ1233814

Dimitri P. Bertsekas

Publication date: 1977

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

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

Mathematics Subject Classification ID

Nonlinear programming (90C30) Numerical methods in optimal control (49M99) Approximation by arbitrary linear expressions (41A45)

Related Items

Guaranteed deterministic approach to superhedging: a numerical experiment, Decomposition Methods Based on Augmented Lagrangians: A Survey, Algorithms for a class of nondifferentiable problems, Algorithm of uniform filling of nonlinear dynamic system reachable set based on maximin problem solution, Inexact smoothing method for large scale minimax optimization, Randomized search directions in descent methods for minimizing certain quasidifferentiable functions, An algorithm for convex constrained minimax optimization based on duality, Flattened aggregate function method for nonlinear programming with many complicated constraints, An algorithm based on active sets and smoothing for discretized semi-infinite minimax problems, Multiplier methods: A survey, A smoothing iterative method for the finite minimax problem, Generic algorithm for generalized fractional programming, Regularized smoothing approximations to vertical nonlinear complementarity problems, Stochastic variance-reduced prox-linear algorithms for nonconvex composite optimization, A quadratic approximation method for minimizing a class of quasidifferentiable functions, On the finite termination of an entropy function based non-interior continuation method for vertical linear complementarity problems, Entropy function-based algorithms for solving a class of nonconvex minimization problems

Cites Work

• Algorithms for a class of nondifferentiable problems
• Multiplier methods: A survey
• Multiplier and gradient methods
• The multiplier method of Hestenes and Powell applied to convex programming
• On Penalty and Multiplier Methods for Constrained Minimization
• A new algorithm for solution of resistive networks involving diodes
• Convex Analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item