New approach to comparison of search methods used in nonlinear programming problems

DOI10.1007/BF00933622MaRDI QIDQ2560771zbMATH OpenFDO

Authors Oleg Larichev, G. G. Gorvits

Publication date 1974

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

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3220839 (Why is no real title available?)
• scientific article; zbMATH DE number 3282977 (Why is no real title available?)
• scientific article; zbMATH DE number 3307153 (Why is no real title available?)
• A Comparison of Several Current Optimization Methods, and the use of Transformations in Constrained Problems
• A Rapidly Convergent Descent Method for Minimization
• An Iterative Method for Finding Stationary Values of a Function of Several Variables
• Function Minimization Without Evaluating Derivatives--a Review
• Function minimization by conjugate gradients
• On variable-metric algorithms
• Properties of the conjugate-gradient and Davidon methods
• Unified approach to quadratically convergent algorithms for function minimization

Cited in

(1)

• Bibliography on the evaluation of numerical software

This page was built for publication: New approach to comparison of search methods used in nonlinear programming problems

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