A New Method with Descent Property for Symmetric Nonlinear Equations
From MaRDI portal
Publication:3058366
DOI10.1080/01630563.2010.498599zbMATH Open1201.90164OpenAlexW2094160599MaRDI QIDQ3058366FDOQ3058366
Authors: Gonglin Yuan 
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
Recommendations
- Descent Directions of Quasi-Newton Methods for Symmetric Nonlinear Equations
- New method of solving nonlinear variable coefficient equations by using symmetry
- A norm descent derivative-free algorithm for solving large-scale nonlinear symmetric equations
- A new descent method for symmetric non-monotone variational inequalities with application to eigenvalue complementarity problems
- Newton's method for symmetric and bisymmetric solvents of the nonlinear matrix equations
- A new method for the numerical solution of simultaneous nonlinear equations
- Generalized Descent Methods for Asymmetric Systems of Equations
- Norm descent conjugate gradient methods for solving symmetric nonlinear equations
- A numerical method of solving systems of non-linear equations by curvilinear descent
- An approach via symmetrization methods to nonlinear elliptic problems with a lower order term
Cites Work
- Title not available (Why is that?)
- 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
- A Globally and Superlinearly Convergent Gauss--Newton-Based BFGS Method for Symmetric Nonlinear Equations
- Numerical Schubert Calculus by the Pieri Homotopy Algorithm
- A conjugate gradient method with descent direction for unconstrained optimization
- The convergence properties of some new conjugate gradient methods
- New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems
- Convergence Theory of Nonlinear Newton–Krylov Algorithms
- The superlinear convergence analysis of a nonmonotone BFGS algorithm on convex objective functions
- Nonmonotone backtracking inexact quasi-Newton algorithms for solving smooth nonlinear equations
- The “global” convergence of Broyden-like methods with suitable line search
- New line search methods for unconstrained optimization
- Convergence of line search methods for unconstrained optimization
- Testing parallel variable transformation
- A trust-region-based BFGS method with line search technique for symmetric nonlinear equations
Cited In (9)
- Limited memory BFGS method with backtracking for symmetric nonlinear equations
- A conjugate gradient algorithm for large-scale nonlinear equations and image restoration problems
- A limited memory BFGS method for solving large-scale symmetric nonlinear equations
- A modified conjugate gradient algorithm with backtracking line search technique for large-scale nonlinear equations
- Descent Directions of Quasi-Newton Methods for Symmetric Nonlinear Equations
- Limited memory technique using trust regions for nonlinear equations
- A quasi-Newton algorithm for large-scale nonlinear equations
- A BFGS algorithm for solving symmetric nonlinear equations
- A modified three-term PRP conjugate gradient algorithm for optimization models
This page was built for publication: A New Method with Descent Property for Symmetric Nonlinear Equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3058366)
