Norm descent conjugate gradient methods for solving symmetric nonlinear equations (Q496604): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Yun-hai Xiao / rank
Normal rank
 
Property / author
 
Property / author: Yun-hai Xiao / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CG_DESCENT / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10898-014-0218-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1987583991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient descent directions in unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Point Step Size Gradient Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonmonotone spectral method for large-scale symmetric nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A family of derivative-free conjugate gradient methods for large-scale nonlinear systems of equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: CUTE / rank
 
Normal rank
Property / cites work
 
Property / cites work: New conjugacy conditions and related nonlinear conjugate gradient methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nonlinear Conjugate Gradient Algorithm with an Optimal Property and an Improved Wolfe Line Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descent Directions of Quasi-Newton Methods for Symmetric Nonlinear Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 851 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Globally and Superlinearly Convergent Gauss--Newton-Based BFGS Method for Symmetric Nonlinear Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified Fletcher-Reeves-type derivative-free method for symmetric nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A conjugate gradient method to solve convex constrained monotone equations with applications in compressive sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new backtracking inexact BFGS method for symmetric nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: BFGS trust-region method for symmetric nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence properties of an iterative method for solving symmetric non-linear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Inexact PRP Conjugate Gradient Method for Symmetric Nonlinear Equations / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:51, 10 July 2024

scientific article
Language Label Description Also known as
English
Norm descent conjugate gradient methods for solving symmetric nonlinear equations
scientific article

    Statements

    Norm descent conjugate gradient methods for solving symmetric nonlinear equations (English)
    0 references
    0 references
    0 references
    0 references
    22 September 2015
    0 references
    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.
    0 references
    0 references
    unconstrained optimization
    0 references
    conjugate gradient method
    0 references
    backtracking line search
    0 references
    numerical examples
    0 references
    large-scale symmetric nonlinear equations
    0 references
    global convergence
    0 references
    0 references
    0 references
    0 references