Modifications and extensions of the conjugate gradient-restoration algorithm for mathematical programming problems

DOI10.1007/BF00931981zbMath0204.49502OpenAlexW1971489217WikidataQ113108488 ScholiaQ113108488MaRDI QIDQ2542010

A. V. Levy, E. E. Cragg, Angelo Miele

Publication date: 1971

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00931981

Related Items (7)

Two-phase model algorithm with global convergence for nonlinear programming ⋮ Inexact-restoration algorithm for constrained optimization ⋮ An interior-point method for solving box-constrained underdetermined nonlinear systems ⋮ On the optimization of constrained functions: Comparison of sequential gradient-restoration algorithm and gradient-projection algorithm ⋮ Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming. ⋮ Use of the augmented penalty function in mathematical programming problems. II. Conjugate gradient-restoration algorithm ⋮ A flexible inexact-restoration method for constrained optimization

Cites Work

• The restoration of constraints in holonomic and nonholonomic problems
• Sequential gradient-restoration algorithm for the minimization of constrained functions. Ordinary and conjugate gradient versions
• Unnamed Item

This page was built for publication: Modifications and extensions of the conjugate gradient-restoration algorithm for mathematical programming problems