A globally convergent BFGS method for nonlinear monotone equations without any merit functions
From MaRDI portal
Publication:3055067
DOI10.1090/S0025-5718-08-02121-2zbMath1203.90180MaRDI QIDQ3055067
Publication date: 7 November 2010
Published in: Mathematics of Computation (Search for Journal in Brave)
90C53: Methods of quasi-Newton type
Related Items
New BFGS method for unconstrained optimization problem based on modified Armijo line search, A three-term derivative-free projection method for nonlinear monotone system of equations, Two derivative-free projection approaches for systems of large-scale nonlinear monotone equations, New cautious BFGS algorithm based on modified Armijo-type line search, A modified Hestenes-Stiefel projection method for constrained nonlinear equations and its linear convergence rate, Non-smooth equations based method for \(\ell_1\)-norm problems with applications to compressed sensing, New nonsmooth equations-based algorithms for \(\ell_1\)-norm minimization and applications, A conjugate gradient method to solve convex constrained monotone equations with applications in compressive sensing, A global convergent quasi-Newton method for systems of monotone equations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients
- Variable metric algorithms: Necessary and sufficient conditions for identical behaviour of nonquadratic functions
- Monotonicity of Fixed Point and Normal Mappings Associated with Variational Inequality and Its Application
- On the Global Convergence of the BFGS Method for Nonconvex Unconstrained Optimization Problems
- Global convergence of the partitioned BFGS algorithm for convex partially separable optimization
- The “global” convergence of Broyden-like methods with suitable line search
- Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
- Quasi-Newton Algorithms with Updates from the Preconvex Part of Broyden's Family
- A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
- Updating Quasi-Newton Matrices with Limited Storage
- Quasi-Newton Methods, Motivation and Theory
- BFGS with Update Skipping and Varying Memory
- Newton-type Methods with Generalized Distances For Constrained Optimization
- A derivative-free line search and global convergence of Broyden-like method for nonlinear equations
- A Globally and Superlinearly Convergent Gauss--Newton-Based BFGS Method for Symmetric Nonlinear Equations
- On the Local and Superlinear Convergence of Quasi-Newton Methods
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- Descent Directions of Quasi-Newton Methods for Symmetric Nonlinear Equations
- Convergence Properties of the BFGS Algoritm
- A Class of Methods for Solving Nonlinear Simultaneous Equations
- On the Convergence of the Variable Metric Algorithm
- A modified BFGS method and its global convergence in nonconvex minimization
