A nonmonotone PSB algorithm for solving unconstrained optimization
From MaRDI portal
Publication:694601
DOI10.1007/s10589-011-9408-0zbMath1282.90179OpenAlexW2007811825MaRDI QIDQ694601
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
unconstrained optimizationglobal convergencesuperlinear convergencenonmonotone line searchPSB method
Cites Work
- Unnamed Item
- Unnamed Item
- A class of globally convergent conjugate gradient methods
- A truncated Newton method with non-monotone line search for unconstrained optimization
- Global convergence of algorithms with nonmonotone line search strategy in unconstrained optimization
- Nonmonotone globalization techniques for the Barzilai-Borwein gradient method
- Convergence of nonmonotone line search method
- On the Global Convergence of the BFGS Method for Nonconvex Unconstrained Optimization Problems
- Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
- On the Global Convergence of Broyden's Method
- A derivative-free line search and global convergence of Broyden-like method for nonlinear equations
- Analysis of a Symmetric Rank-One Trust Region Method
- A Nonmonotone Line Search Technique for Newton’s Method
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- Convergence Properties of the BFGS Algoritm
- Global convergece of the bfgs algorithm with nonmonotone linesearch∗∗this work is supported by national natural science foundation$ef:
- Globally convergent Broyden-like methods for semismooth equations and applications to VIP, NCP and MCP
- On the nonmonotone line search
This page was built for publication: A nonmonotone PSB algorithm for solving unconstrained optimization
