Convergence of multi-step curve search method for unconstrained optimization

DOI10.1163/1569395042571292MaRDI QIDQ4659957zbMATH OpenOpenAlexFDO

Authors

Publication date 21 March 2005

Full work available at URL https://doi.org/10.1163/1569395042571292

zbMATH Keywords

global convergencelarge scale problemsmulti-step curve search methodnumerical experimentsunconstrained optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)

Recommendations

• On the convergence of curvilinear search algorithms in unconstrained optimization
• scientific article; zbMATH DE number 611142
• Convergence of line search methods for unconstrained optimization
• scientific article; zbMATH DE number 1217759
• Curved search methods for unconstrained optimization
• A multi-step curve search algorithm in nonlinear optimization
• A multi-step curve search algorithm in nonlinear optimization: nondifferentiable convex case
• Publication:4936541
• Multi-step nonlinear conjugate gradient methods for unconstrained minimization
• Global convergence of a curvilinear search for non-convex optimization

Cited in

(5)

• Convergence of supermemory gradient method
• Memory gradient method with Goldstein line search
• A new class of multi-step descent methods with curve search rule
• A multi-step curve search algorithm in nonlinear optimization
• A new class of supermemory gradient methods

Describes a project that uses

Uses Software

• minpack

This page was built for publication: Convergence of multi-step curve search method for unconstrained optimization

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