On a three step method for minimization of functions

MaRDI QIDQ2430280zbMATH OpenFDO

Authors M. Ya. Bartish, N. Ph. Ogorodnyk

Publication date 6 April 2011

Published in Matematychni Studiï (Search for Journal in Brave)

zbMATH Keywords

gradient methodlinear interpolationunconstrained minimization problem

Mathematics Subject Classification ID

Methods of reduced gradient type (90C52)

Recommendations

• Three step algorithm for function minimization
• A three-step method of linearization for minimization problems
• Three steps methods for solving problems of unconditional minimization
• Three-step method of gradient projection for minimization problems
• A three-step regularized method of linearization for solving minimization problems
• scientific article; zbMATH DE number 3312377
• Three-step methods for nonexpansive mappings and variational inequalities
• scientific article; zbMATH DE number 2204679
• A note on minimization problems and multistep methods
• Minimization methods for functions on simple sets

Cited in

(7)

• Three step algorithm for function minimization
• A new descent algorithm using the three-step discretization method for solving unconstrained optimization problems
• Iterative difference three step method with \(1 + \sqrt{2}\) convergence rate
• Three steps methods for solving problems of unconditional minimization
• Modification of chord method for solving optimization problems
• scientific article; zbMATH DE number 622490 (Why is no real title available?)
• A nonquadratic one dimensional interpolation method for optimization

This page was built for publication: On a three step method for minimization of functions

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