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

DOI10.1007/S43069-023-00193-9zbMATH Open1522.49018OpenAlexW4327941006MaRDI QIDQ6155635FDOQ6155635

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

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

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)

Cites Work

• Title not available (Why is that?)
• An unconstrained optimization test functions collection
• Optimization. Algorithms and consistent approximations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

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)