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

DOI10.1007/BF00931981zbMath0212.49101OpenAlexW1971489217WikidataQ113108488 ScholiaQ113108488MaRDI QIDQ2544702

E. E. Cragg, A. V. Levy, 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

Mathematics Subject Classification ID

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

Related Items (6)

Multiobjective approximate gradient projection method for constrained vector optimization: sequential optimality conditions without constraint qualifications ⋮ On minimax eigenvalue problems via constrained optimization ⋮ Local convergence of an inexact-restoration method and numerical experiments ⋮ Properties of the sequential gradient-restoration algorithm (SGRA). I: Introduction and comparison with related methods ⋮ Properties of the sequential gradient-restoration algorithm (SGRA). II: Convergence analysis ⋮ Periodically preconditioned conjugate gradient-restoration algorithm

Cites Work

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

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