Use of dynamic programming to accelerate convergence of directional optimization algorithms

DOI10.1007/BF00935622zbMath0281.49013OpenAlexW2020342386MaRDI QIDQ1843808

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) Mathematical programming (90C99) Hamilton-Jacobi theories (49L99)

Cites Work

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

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