Orthogonal and conjugate basis methods for solving equality constrained minimization problems
DOI10.1007/BF01299155zbMath0790.65052OpenAlexW1971401611MaRDI QIDQ1312090
Publication date: 23 June 1994
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01299155
constrained optimizationsequential quadratic programmingnumerical experimentslocal convergenceorthogonal baseminimization algorithmsconjugate baserestoration steps technique
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Quadratic programming (90C20) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A numerically stable dual method for solving strictly convex quadratic programs
- A tolerant algorithm for linearly constrained optimization calculations
- An algorithm for composite nonsmooth optimization problems
- Test examples for nonlinear programming codes
- A globally convergent method for nonlinear programming
- An analysis of reduced Hessian methods for constrained optimization
- On the Convergence of Constrained Optimization Methods with Accurate Hessian Information on a Subspace
- On the Local Convergence of a Quasi-Newton Method for the Nonlinear Programming Problem
- An example of irregular convergence in some constrained optimization methods that use the projected hessian
- On the quadratic programming algorithm of Goldfarb and Idnani
- On Secant Updates for Use in General Constrained Optimization
- Nonlinear programming via an exact penalty function: Global analysis
- Nonlinear programming via an exact penalty function: Asymptotic analysis
- An SQP Augmented Lagrangian BFGS Algorithm for Constrained Optimization
This page was built for publication: Orthogonal and conjugate basis methods for solving equality constrained minimization problems
