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

DOI10.1007/BF00931981zbMATH Open0212.49101OpenAlexW1971489217WikidataQ113108488 ScholiaQ113108488MaRDI QIDQ2544702FDOQ2544702

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

Cites Work

• Sequential gradient-restoration algorithm for the minimization of constrained functions. Ordinary and conjugate gradient versions
• The restoration of constraints in holonomic and nonholonomic problems
• Title not available (Why is that?)

Cited In (6)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2544702)