A nonmonotone line search slackness technique for unconstrained optimization

DOI10.1007/s10957-012-0247-7zbMath1274.90383OpenAlexW2036873253MaRDI QIDQ378287

Ping Hu, Xu-Qing Liu

Publication date: 11 November 2013

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-012-0247-7

zbMATH Keywords

BFGS algorithmnonmonotone line search slackness techniqueunconstrained optimization problem

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items

A nonmonotone ODE-based method for unconstrained optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Global convergence of nonmonotone descent methods for unconstrained optimization problems
• New inexact line search method for unconstrained optimization
• Convergence of PRP method with new nonmonotone line search
• A truncated Newton method with non-monotone line search for unconstrained optimization
• Nonmonotone line search algorithm for constrained minimax problems
• An unconstrained optimization method using nonmonotone second order Goldstein's line search
• Convergence of nonmonotone line search method
• A Nonmonotone Line Search Technique for Newton’s Method
• A new nonmonotone line search technique for unconstrained optimization
• Adaptive nonmonotone line search method for unconstrained optimization