A step size rule for unconstrained optimization

DOI10.1007/BF02248697MaRDI QIDQ1207052zbMATH OpenOpenAlexFDO

Authors Jiří Rohn

Publication date 4 May 1993

Published in Computing (Search for Journal in Brave)

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

zbMATH Keywords

line searchunconstrained nonlinear minimizationinexact searchstep size rule

Mathematics Subject Classification ID

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

Recommendations

• On step-size estimation of line search methods
• Some new step-size rules for optimization problems
• Line search by curve fitting in minimization algorithms
• A new descent algorithm with curve search rule
• New inexact line search method for unconstrained optimization

Cites work

• scientific article; zbMATH DE number 3687182 (Why is no real title available?)
• scientific article; zbMATH DE number 3466802 (Why is no real title available?)
• scientific article; zbMATH DE number 3407464 (Why is no real title available?)
• A step size rule for unconstrained optimization

Cited in

(10)

• Line search by curve fitting in minimization algorithms
• A step size rule for unconstrained optimization
• scientific article; zbMATH DE number 1123971 (Why is no real title available?)
• scientific article; zbMATH DE number 1424420 (Why is no real title available?)
• scientific article; zbMATH DE number 4047455 (Why is no real title available?)
• A new line search technique
• On step-size estimation of line search methods
• A More Lenient Stopping Rule for Line Search Algorithms
• scientific article; zbMATH DE number 786546 (Why is no real title available?)
• Some new step-size rules for optimization problems

This page was built for publication: A step size rule for unconstrained optimization

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