Dual techniques for constrained optimization
From MaRDI portal
Publication:1091272
DOI10.1007/BF00939044zbMath0622.90075MaRDI QIDQ1091272
Publication date: 1987
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
constrained optimizationdualityconjugate gradient methodmultiplier methodsaugmented Lagrangiannull space methodsglobal quadratic convergencepreconditioning strategy
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Related Items
Application of the dual active set algorithm to quadratic network optimization, LMBOPT: a limited memory method for bound-constrained optimization, The evolution and discharge of electric fields within a thunderstorm, Least squares modifications with inverse factorizations: Parallel implications, A new fast method to compute saddle-points in constrained optimization and applications, Fast quadratic programming for mean-variance portfolio optimisation, Numerical comparison of augmented Lagrangian algorithms for nonconvex problems, The global convergence of augmented Lagrangian methods based on NCP function in constrained nonconvex optimization, Dual active sets and constrained optimization, Analysis and implementation of a dual algorithm for constrained optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sequential gradient-restoration algorithm for optimal control problems with nondifferential constraints
- On a successive transformation of probability distribution and its application to the analysis of the optimum gradient method
- A globally and quadratically convergent algorithm for general nonlinear programming problems
- Diagonalized multiplier methods and quasi-Newton methods for constrained optimization
- Sequential gradient-restoration algorithm for optimal control problems with general boundary conditions
- A derivative-based bracketing scheme for univariate minimization and the conjugate gradient method
- Über monotone Matrixfunktionen
- A Newton-Raphson method for the solution of systems of equations
- Multiplier and gradient methods
- Sequential gradient-restoration algorithm for optimal control problems
- The multiplier method of Hestenes and Powell applied to convex programming
- Dual Approximations in Optimal Control
- Approximations to the Multiplier Method
- Projected Hessian Updating Algorithms for Nonlinearly Constrained Optimization
- Lipschitz Continuity for Constrained Processes
- A globally convergent constrained quasi-Newton method with an augmented lagrangian type penalty function
- Variable Metric Method for Minimization
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
- Algorithms for nonlinear constraints that use lagrangian functions
- Optimal Coatings, Bang‐Bang Controls, And Gradient Techniques
- A Rapidly Convergent Descent Method for Minimization
- A quadratically-convergent algorithm for general nonlinear programming problems
