A generalized golden-section algorithm for line search

DOI10.1093/IMAMCI/15.2.185MaRDI QIDQ3840761zbMATH OpenOpenAlexFDO

Authors Luc Pronzato, Henry P. Wynn, A. Zhigljavsky

Publication date 15 June 1999

Published in IMA Journal of Mathematical Control and Information (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/401078746acd7b43859ad95a53576615fc94e707

zbMATH Keywords

golden-section line-search algorithmMarkov-chainRenyi entropy

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Recommendations

• Finite sample behaviour of an ergodically fast line-search algorithm
• scientific article; zbMATH DE number 862330
• Stochastic Analysis of Convergence via Dynamic Representation for a Class of Line-search Algorithms
• The chaotic behaviour of search algorithms

Cited in

(8)

• Finite sample behaviour of an ergodically fast line-search algorithm
• A general framework for searching on a line
• Golden ratio simulated annealing for protein folding problem
• scientific article; zbMATH DE number 1222554 (Why is no real title available?)
• Stochastic Analysis of Convergence via Dynamic Representation for a Class of Line-search Algorithms
• The golden section search algorithm for finding a good shape parameter for meshless collocation methods
• scientific article; zbMATH DE number 822890 (Why is no real title available?)
• scientific article; zbMATH DE number 862330 (Why is no real title available?)

This page was built for publication: A generalized golden-section algorithm for line search

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