Some new step-size rules for optimization problems

DOI10.1007/s11741-007-0209-8zbMath1142.65366OpenAlexW2036281985MaRDI QIDQ5436239

Qing-Jun Wu, Zeng-xin Wei

Publication date: 14 January 2008

Published in: Journal of Shanghai University (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11741-007-0209-8

zbMATH Keywords

convergenceglobal convergenceunconstrained minimizationline search methodsArmijo step-size ruleArmijo-Goldstein step-size ruleWolfe-Powell step-size rule

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Cites Work

• A new method for nonsmooth convex optimization
• Minimization of functions having Lipschitz continuous first partial derivatives
• New Proximal Point Algorithms for Convex Minimization
• A modification of Armijo's step-size rule for negative curvature
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Convergence analysis of a proximal newton method¹
• A Globally and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization
• A Nonmonotone Line Search Technique for Newton’s Method
• Asymptotic Convergence Analysis of Some Inexact Proximal Point Algorithms for Minimization