CGS algorithms for constrained extremization of functions

DOI10.1007/BF00933435zbMath0377.65021OpenAlexW1989879195MaRDI QIDQ1246254

R. F. Dennemeyer

Publication date: 1979

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

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

Mathematics Subject Classification ID

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

Related Items

Numerical experience with conjugate direction methods in constrained minimization

Cites Work

• Extensions of CGS algorithms: Generalized least-square solutions
• The prerestorative step in the sequential gradient-restoration algorithm for mathematical programming problems with inequality constraints
• CGS algorithms for unconstrained minimization of functions
• Sequential gradient-restoration algorithm for the minimization of constrained functions. Ordinary and conjugate gradient versions
• Unconstrained approach to the extremization of constrained functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item