Approximation procedures based on the method of multipliers

DOI10.1007/BF00933293MaRDI QIDQ1233814zbMATH OpenOpenAlexFDO

Authors 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) Approximation by arbitrary linear expressions (41A45) Numerical methods in optimal control (49M99)

Cites work

• scientific article; zbMATH DE number 3466802 (Why is no real title available?)
• scientific article; zbMATH DE number 3595804 (Why is no real title available?)
• scientific article; zbMATH DE number 3612784 (Why is no real title available?)
• A new algorithm for solution of resistive networks involving diodes
• Algorithms for a class of nondifferentiable problems
• Convex Analysis
• Multiplier and gradient methods
• Multiplier methods: A survey
• On Penalty and Multiplier Methods for Constrained Minimization
• The multiplier method of Hestenes and Powell applied to convex programming

Cited in

(17)

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

This page was built for publication: Approximation procedures based on the method of multipliers

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