Unconstrained approach to the extremization of constrained functions

DOI10.1016/0022-247X(72)90208-9zbMATH Open0238.49019OpenAlexW2030165939MaRDI QIDQ2553077FDOQ2553077

Authors: Yanyan Li 

Publication date: 1972

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-247x(72)90208-9

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Mathematical programming (90Cxx)

Cites Work

• A Rapidly Convergent Descent Method for Minimization
• Function minimization by conjugate gradients
• A new approach to variable metric algorithms
• Methods of conjugate gradients for solving linear systems
• Variable metric methods of minimisation
• Unified approach to quadratically convergent algorithms for function minimization
• Numerical experiments on quadratically convergent algorithms for function minimization
• Title not available (Why is that?)
• Comparison of some conjugate direction procedures for function minimization
• Computational experience with quadratically convergent minimisation methods
• Unconstrained approach to the extremization of constrained functions
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (4)

• CGS algorithms for constrained extremization of functions
• A geometric method in nonlinear programming
• Unconstrained approach to the extremization of constrained functions
• Method of dual matrices for function minimization

This page was built for publication: Unconstrained approach to the extremization of constrained functions

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