Use of dynamic programming to accelerate convergence of directional optimization algorithms

DOI10.1007/BF00935622MaRDI QIDQ1843808zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 1975

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

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

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Hamilton-Jacobi theories (49L99) Mathematical programming (90C99)

Cites work

• A Rapidly Convergent Descent Method for Minimization
• Methods of conjugate gradients for solving linear systems
• Scheduling to Minimize Interaction Cost
• `` Direct Search Solution of Numerical and Statistical Problems

This page was built for publication: Use of dynamic programming to accelerate convergence of directional optimization algorithms

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