On the optimization of constrained functions: Comparison of sequential gradient-restoration algorithm and gradient-projection algorithm

DOI10.1016/0096-3003(76)90006-0zbMath0365.65042OpenAlexW1972647904MaRDI QIDQ1241259

K. Appert

Publication date: 1976

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

Full work available at URL: https://doi.org/10.1016/0096-3003(76)90006-0

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items (1)

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

Cites Work

• Sequential gradient-restoration algorithm for the minimization of constrained functions. Ordinary and conjugate gradient versions
• Modifications and extensions of the conjugate gradient-restoration algorithm for mathematical programming problems
• 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

This page was built for publication: On the optimization of constrained functions: Comparison of sequential gradient-restoration algorithm and gradient-projection algorithm