A nonmonotone PSB algorithm for solving unconstrained optimization

DOI10.1007/S10589-011-9408-0MaRDI QIDQ694601zbMATH OpenOpenAlexFDO

Authors Jiao Li, Yufei Yang, Bo Yu

Publication date 13 December 2012

Published in Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10589-011-9408-0

zbMATH Keywords

global convergenceunconstrained optimizationsuperlinear convergencenonmonotone line searchPSB method

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Recommendations

• Sufficient descent directions in unconstrained optimization
• A new nonmonotone line search BFGS algorithm
• A nonmonotone modified BFGS algorithm for nonconvex unconstrained optimization problems
• Nonmonotone trust region algorithm for unconstrained optimization problems
• A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization

Cites work

• scientific article; zbMATH DE number 3503002 (Why is no real title available?)
• scientific article; zbMATH DE number 954679 (Why is no real title available?)
• A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
• A Nonmonotone Line Search Technique for Newton’s Method
• A class of globally convergent conjugate gradient methods
• A derivative-free line search and global convergence of Broyden-like method for nonlinear equations
• A truncated Newton method with non-monotone line search for unconstrained optimization
• Analysis of a Symmetric Rank-One Trust Region Method
• Convergence Properties of the BFGS Algoritm
• Convergence of nonmonotone line search method
• Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
• Global convergece of the bfgs algorithm with nonmonotone linesearch^∗∗this work is supported by national natural science foundation$ef:
• Global convergence of algorithms with nonmonotone line search strategy in unconstrained optimization
• Globally convergent Broyden-like methods for semismooth equations and applications to VIP, NCP and MCP
• Nonmonotone globalization techniques for the Barzilai-Borwein gradient method
• On the Global Convergence of Broyden's Method
• On the global convergence of the BFGS method for nonconvex unconstrained optimization problems
• On the nonmonotone line search

Cited in

(2)

• A partitioned PSB method for partially separable unconstrained optimization problems
• Sufficient descent directions in unconstrained optimization

This page was built for publication: A nonmonotone PSB algorithm for solving unconstrained optimization

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