A quadratically convergent primal-dual algorithm with global convergence properties for solving optimization problems with equality constraints
From MaRDI portal
Publication:4121703
DOI10.1007/BF01681354zbMath0351.90065MaRDI QIDQ4121703
No author found.
Publication date: 1975
Published in: Mathematical Programming (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (19)
A class of augmented Lagrangians for equality constraints in nonlinear programming problems ⋮ Decomposition Methods Based on Augmented Lagrangians: A Survey ⋮ Exact penalties for variational inequalities with applications to nonlinear complementarity problems ⋮ An exact penalty function method with global convergence properties for nonlinear programming problems ⋮ A globally convergent, implementable multiplier method with automatic penalty limitation ⋮ A new augmented Lagrangian function for inequality constraints in nonlinear programming problems ⋮ Enlarging the region of convergence of Newton's method for constrained optimization ⋮ A Gauss-Newton approach for solving constrained optimization problems using differentiable exact penalties ⋮ New decomposition and convexification algorithm for nonconvex large-scale primal-dual optimization ⋮ Implementing a Smooth Exact Penalty Function for Equality-Constrained Nonlinear Optimization ⋮ Feasible directions algorithms for optimization problems with equality and inequality constraints ⋮ Multiplier methods: A survey ⋮ A multiplier method with automatic limitation of penalty growth ⋮ On the global stabilization of locally convergent algorithms ⋮ On the finite element solution of frictionless contact problems using an exact penalty approach ⋮ Mixed coordination method for long-horizon optimal control problems ⋮ A second-order method for the general nonlinear programming problem ⋮ Further study on a class of augmented Lagrangians of Di Pillo and Grippo in nonlinear programming ⋮ A method of centers algorithm for certain minimax problems
Cites Work
- Multiplier and gradient methods
- A new approach to constrained function optimization
- Combined Primal-Dual and Penalty Methods for Constrained Minimization
- An Algorithm for Least-Squares Estimation of Nonlinear Parameters
- On Penalty and Multiplier Methods for Constrained Minimization
- A new method for the optimization of a nonlinear function subject to nonlinear constraints
- The Weierstrass E-Function in the Calculus of Variations
- A method for the solution of certain non-linear problems in least squares
- On the convergence of sequential minimization algorithms
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A quadratically convergent primal-dual algorithm with global convergence properties for solving optimization problems with equality constraints