The prerestorative step in the sequential gradient-restoration algorithm for mathematical programming problems with inequality constraints

DOI10.1016/0096-3003(77)90006-6zbMath0364.65049OpenAlexW2063719936WikidataQ113104990 ScholiaQ113104990MaRDI QIDQ1241018

K. Appert

Publication date: 1977

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1911/104719

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items

On minimax eigenvalue problems via constrained optimization, On a Newton-like method for constrained nonlinear minimization via slack variables, CGS algorithms for constrained extremization of functions, Numerical experience with conjugate direction methods in constrained minimization

Cites Work

• On the optimization of constrained functions: Comparison of sequential gradient-restoration algorithm and gradient-projection algorithm
• Sequential gradient-restoration algorithm for the minimization of constrained functions. Ordinary and conjugate gradient versions
• An approach to nonlinear programming
• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
• The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
• Unnamed Item
• Unnamed Item
• Unnamed Item