Analysis and implementation of a dual algorithm for constrained optimization

From MaRDI portal
Publication:1321425

DOI10.1007/BF00940552zbMath0797.90092OpenAlexW2092285919MaRDI QIDQ1321425

William W. Hager

Publication date: 25 October 1994

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

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



Related Items

On the use of optimization models for portfolio selection: A review and some computational results, On R-linear convergence of semi-monotonic inexact augmented Lagrangians for bound and equality constrained quadratic programming problems with application, LMBOPT: a limited memory method for bound-constrained optimization, An optimal algorithm for bound and equality constrained quadratic programming problems with bounded spectrum, Optimal iterative QP and QPQC algorithms, Sparse solutions of optimal control via Newton method for under-determined systems, Handling infeasibility in a large-scale nonlinear optimization algorithm, On R-linear convergence of semi-monotonic inexact augmented Lagrangians for saddle point problems, An optimal algorithm for a class of equality constrained quadratic programming problems with bounded spectrum, Augmented Lagrangian methods under the constant positive linear dependence constraint qualification, Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization, Numerical comparison of augmented Lagrangian algorithms for nonconvex problems, Semi-monotonic inexact augmented Lagrangians for quadratic programing with equality constraints, Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming, Projection onto a Polyhedron that Exploits Sparsity, New versions of Newton method: step-size choice, convergence domain and under-determined equations, Dual active sets and constrained optimization


Uses Software


Cites Work