A least-distance programming procedure for minimization problems under linear constraints
From MaRDI portal
Publication:1170113
DOI10.1007/BF00933968zbMath0496.90066OpenAlexW1965705307MaRDI QIDQ1170113
Jamie J. Goode, Mokhtar S. Bazaraa
Publication date: 1983
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00933968
global convergencelinear constraintssolution algorithmscomputational testingArmijo's inexact line searchCholesky's factorizationLemke's complementary pivoting algorithm
Related Items
On Poljak's improved subgradient method, On using equality-constraint algorithms for inequality constrained problems, On convergence properties of a least-distance programming procedure for minimization problems under linear constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An algorithm for linearly constrained nonlinear programming problems
- A globally convergent method for nonlinear programming
- Minimization of functions having Lipschitz continuous first partial derivatives
- Stability of the solution of definite quadratic programs
- Readily implementable conjugate gradient methods
- Exact penalty functions in nonlinear programming
- On the Goldstein-Levitin-Polyak gradient projection method
- Large-scale linearly constrained optimization
- Convex programming in Hilbert space
- The Convex Simplex Method
- Second Order Conditions for Constrained Minima
- Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints
- On the Convergence of Gradient Methods under Constraint
