Method of dual matrices for function minimization

DOI10.1007/BF00933042MaRDI QIDQ2560773zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 1974

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

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

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3402051 (Why is no real title available?)
• scientific article; zbMATH DE number 3402052 (Why is no real title available?)
• A Rapidly Convergent Descent Method for Minimization
• A new approach to variable metric algorithms
• Computational experience with quadratically convergent minimisation methods
• Function minimization by conjugate gradients
• Methods of conjugate gradients for solving linear systems
• Numerical experiments on quadratically convergent algorithms for function minimization
• Properties of the conjugate-gradient and Davidon methods
• Quadratically convergent algorithms and one-dimensional search schemes
• Quasi-Newton Methods and their Application to Function Minimisation
• Unconstrained approach to the extremization of constrained functions
• Unified approach to quadratically convergent algorithms for function minimization

Cited in

(2)

• One class of dual matrix methods
• Accelerated conjugate direction methods for unconstrained optimization

This page was built for publication: Method of dual matrices for function minimization

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