Variations of the steepest descent method in nonrestricted optimization

DOI10.5540/TEMA.2005.06.02.0285MaRDI QIDQ5390811zbMATH OpenOpenAlexFDO

Authors M. Sakamori, Márcia Ap. Gomes-Ruggiero

Publication date 4 April 2011

Published in TEMA - Tendências em Matemática Aplicada e Computacional (Search for Journal in Brave)

Full work available at URL https://doi.org/10.5540/tema.2005.06.02.0285

Mathematics Subject Classification ID

Methods of reduced gradient type (90C52)

Recommendations

• A new stepsize for the steepest descent method
• scientific article; zbMATH DE number 2221955
• scientific article; zbMATH DE number 1960973
• A limited memory steepest descent method
• A descent method for unconstrained optimization problems

Cited in

(4)

• A stepsize control for the Botsaris-Newton method
• Overlooked Branch Cut in Steepest Descent Method: Switching Line and Atomic Domain
• A steepest descent-like method for variable order vector optimization problems
• Relaxed steepest descent and Cauchy-Barzilai-Borwein method

This page was built for publication: Variations of the steepest descent method in nonrestricted optimization

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