Approximation procedures based on the method of multipliers
From MaRDI portal
Cites work
- A new algorithm for solution of resistive networks involving diodes
- Algorithms for a class of nondifferentiable problems
- Convex Analysis
- 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?)
- 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
(19)- Generic algorithm for generalized fractional programming
- A quadratic approximation method for minimizing a class of quasidifferentiable functions
- Algorithms for a class of nondifferentiable problems
- An algorithm for convex constrained minimax optimization based on duality
- Multiplier methods: A survey
- Regularized smoothing approximations to vertical nonlinear complementarity problems
- Stochastic variance-reduced prox-linear algorithms for nonconvex composite optimization
- Guaranteed deterministic approach to superhedging: a numerical experiment
- Flattened aggregate function method for nonlinear programming with many complicated constraints
- A smoothing iterative method for the finite minimax problem
- Algorithm of uniform filling of nonlinear dynamic system reachable set based on maximin problem solution
- Entropy function-based algorithms for solving a class of nonconvex minimization problems
- Decomposition methods based on augmented Lagrangians: a survey
- Randomized search directions in descent methods for minimizing certain quasidifferentiable functions
- Inexact smoothing method for large scale minimax optimization
- Accelerated first-order optimization under nonlinear constraints
- Log-exponential approximation in semi-infinite programming: a variational approach
- On the finite termination of an entropy function based non-interior continuation method for vertical linear complementarity problems
- An algorithm based on active sets and smoothing for discretized semi-infinite minimax problems
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)