Norm descent conjugate gradient methods for solving symmetric nonlinear equations
From MaRDI portal
The authors propose a family of conjugate gradient methods for solving large-scale symmetric nonlinear equations. The proposed methods do not require the Jacobian information of the quations and do not store any matrix at each iteration. The global convergence of the method is established under certain technical conditions. Some experimental results are presented to show the effectiveness of the proposed methods.
Recommendations
- A norm descent derivative-free algorithm for solving large-scale nonlinear symmetric equations
- Conjugate Gradient-Like Algorithms for Solving Nonsymmetric Linear Systems
- scientific article; zbMATH DE number 440638
- A norm descent conjugate gradient method for monotone equations
- A derivative-free conjugate gradient method and its global convergence for solving symmetric nonlinear equations
- Some conjugate gradient methods for symmetric and nonsymmetric systems
- Sufficient descent nonlinear conjugate gradient methods with conjugacy condition
- Efficient hybrid conjugate gradient method for solving symmetric nonlinear equations
- scientific article; zbMATH DE number 7366152
- An approximate gradient-type method for nonlinear symmetric equations with convex constraints
Cites work
- A conjugate gradient method to solve convex constrained monotone equations with applications in compressive sensing
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- A family of derivative-free conjugate gradient methods for large-scale nonlinear systems of equations
- A Globally and Superlinearly Convergent Gauss--Newton-Based BFGS Method for Symmetric Nonlinear Equations
- A modified Fletcher-Reeves-type derivative-free method for symmetric nonlinear equations
- A new backtracking inexact BFGS method for symmetric nonlinear equations
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- A nonlinear conjugate gradient algorithm with an optimal property and an improved Wolfe line search
- Algorithm 851
- An inexact PRP conjugate gradient method for symmetric nonlinear equations
- BFGS trust-region method for symmetric nonlinear equations
- Convergence properties of an iterative method for solving symmetric non-linear equations
- CUTE
- Descent Directions of Quasi-Newton Methods for Symmetric Nonlinear Equations
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
- New conjugacy conditions and related nonlinear conjugate gradient methods
- Nonmonotone spectral method for large-scale symmetric nonlinear equations
- Sufficient descent directions in unconstrained optimization
- Two-Point Step Size Gradient Methods
Cited in
(20)- A derivative-free conjugate gradient method and its global convergence for solving symmetric nonlinear equations
- A class of line search-type methods for nonsmooth convex regularized minimization
- Some valid generalizations of Boyd and Wong inequality and (,)-weak contraction in partially ordered b-metric spaces
- A new conjugate gradient projection method for convex constrained nonlinear equations
- A Riemannian nonmonotone spectral method for self-adjoint tangent vector field
- Convergence properties of an iterative method for solving symmetric non-linear equations
- A modified BFGS type quasi-Newton method with line search for symmetric nonlinear equations problems
- The Gauss-Newton methods via conjugate gradient path without line search technique for solving nonlinear systems
- A New Method with Descent Property for Symmetric Nonlinear Equations
- Efficient hybrid conjugate gradient method for solving symmetric nonlinear equations
- Approximate norm descent methods for constrained nonlinear systems
- A modified conjugate gradient method via a double direction approach for solving large-scale symmetric nonlinear equations
- Applying powell's symmetrical technique to conjugate gradient methods
- An inexact PRP conjugate gradient method for symmetric nonlinear equations
- A norm descent BFGS method for solving KKT systems of symmetric variational inequality problems
- An efficient modified residual-based algorithm for large scale symmetric nonlinear equations by approximating successive iterated gradients
- An approximate gradient-type method for nonlinear symmetric equations with convex constraints
- A Five-Parameter Class of Derivative-Free Spectral Conjugate Gradient Methods for Systems of Large-Scale Nonlinear Monotone Equations
- A new approximate descent derivative-free algorithm for large-scale nonlinear symmetric equations
- A norm descent derivative-free algorithm for solving large-scale nonlinear symmetric equations
This page was built for publication: Norm descent conjugate gradient methods for solving symmetric nonlinear equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q496604)
