Analysis and implementation of a dual algorithm for constrained optimization
From MaRDI portal
Publication:1321425
DOI10.1007/BF00940552zbMath0797.90092OpenAlexW2092285919MaRDI QIDQ1321425
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
Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dual techniques for constrained optimization
- Application of the Armijo stepsize rule to the solution of a nonlinear system of equalities and inequalities
- Newton's method for nonlinear inequalities
- On the global stabilization of locally convergent algorithms
- Diagonalized multiplier methods and quasi-Newton methods for constrained optimization
- Algorithmic equivalence in quadratic programming. I. A least-distance programming problem
- Test example for nonlinear programming codes
- A robust sequential quadratic programming method
- Global convergence of Rosen's gradient projection method
- A derivative-based bracketing scheme for univariate minimization and the conjugate gradient method
- Multiplier and gradient methods
- Minimization of functions having Lipschitz continuous first partial derivatives
- Newton's method for the solution of systems of equalities and inequalities
- Extension of Newton's method to nonlinear functions with values in a cone
- The multiplier method of Hestenes and Powell applied to convex programming
- A sequential quadratic programming method for potentially infeasible mathematical programs
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- Approximations to the Multiplier Method
- A Gauss-Newton Approach to Solving Generalized Inequalities
- Updating the Inverse of a Matrix
- Strongly Regular Generalized Equations
- A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints
- Nonlinear programming via an exact penalty function: Global analysis
- Nonlinear programming via an exact penalty function: Asymptotic analysis
- Variable Metric Method for Minimization
- Methods for Computing and Modifying the LDV Factors of a Matrix
- Large-scale linearly constrained optimization
- A dual approach to solving nonlinear programming problems by unconstrained optimization
- Methods for Modifying Matrix Factorizations
- A quadratically-convergent algorithm for general nonlinear programming problems
