Collinear gradients method for minimizing smooth functions. Optimality conditions and algorithms

DOI10.1007/S43069-023-00193-9MaRDI QIDQ6155635zbMATH OpenOpenAlexFDO

Authors Victor K. Tolstykh

Publication date 5 June 2023

Published in SN Operations Research Forum (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s43069-023-00193-9

zbMATH Keywords

gradientnecessary conditionsnumerical optimizationminimization of functions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Optimality conditions for free problems in two or more independent variables (49K10)

Recommendations

• A new modification of nonlinear conjugate gradient formula
• A modified secant equation quasi-Newton method for unconstrained optimization
• scientific article; zbMATH DE number 4082858
• Strong global convergence of an adaptive nonmonotone memory gradient method
• Publication:4891093

Cites work

• scientific article; zbMATH DE number 1243473 (Why is no real title available?)
• scientific article; zbMATH DE number 1274356 (Why is no real title available?)
• scientific article; zbMATH DE number 852532 (Why is no real title available?)
• scientific article; zbMATH DE number 3382096 (Why is no real title available?)
• An unconstrained optimization test functions collection
• Optimization. Algorithms and consistent approximations

Cited in

(2)

• Line search termination criteria for collinear scaling algorithms for minimizing a class of convex functions
• On the existence of affine invariant descent directions

This page was built for publication: Collinear gradients method for minimizing smooth functions. Optimality conditions and algorithms

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