A New Method with Descent Property for Symmetric Nonlinear Equations
From MaRDI portal
Publication:3058366
DOI10.1080/01630563.2010.498599zbMath1201.90164MaRDI QIDQ3058366
Publication date: 19 November 2010
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630563.2010.498599
90C26: Nonconvex programming, global optimization
Related Items
A BFGS algorithm for solving symmetric nonlinear equations, Limited memory BFGS method with backtracking for symmetric nonlinear equations
Cites Work
- Unnamed Item
- A trust-region-based BFGS method with line search technique for symmetric nonlinear equations
- A conjugate gradient method with descent direction for unconstrained optimization
- New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems
- The convergence properties of some new conjugate gradient methods
- The superlinear convergence analysis of a nonmonotone BFGS algorithm on convex objective functions
- Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems
- BFGS trust-region method for symmetric nonlinear equations
- A modified PRP conjugate gradient method
- A new backtracking inexact BFGS method for symmetric nonlinear equations
- Testing parallel variable transformation
- Nonmonotone backtracking inexact quasi-Newton algorithms for solving smooth nonlinear equations
- Convergence of line search methods for unconstrained optimization
- New line search methods for unconstrained optimization
- The “global” convergence of Broyden-like methods with suitable line search
- Convergence Theory of Nonlinear Newton–Krylov Algorithms
- A Globally and Superlinearly Convergent Gauss--Newton-Based BFGS Method for Symmetric Nonlinear Equations
- Numerical Schubert Calculus by the Pieri Homotopy Algorithm