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

DOI10.1007/BF00931981MaRDI QIDQ2542010zbMATH OpenOpenAlexWikidataFDO

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

Cites work

• scientific article; zbMATH DE number 3335465 (Why is no real title available?)
• Sequential gradient-restoration algorithm for the minimization of constrained functions. Ordinary and conjugate gradient versions
• The restoration of constraints in holonomic and nonholonomic problems

Cited in

(7)

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

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

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