Sufficient descent conjugate gradient methods for solving convex constrained nonlinear monotone equations (Q1723812): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1155/2014/305643 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2087187949 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5652137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotonicity of Fixed Point and Normal Mappings Associated with Variational Inequality and Its Application / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252831 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superlinear convergence of a Newton-type algorithm for monotone equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A globally convergent BFGS method for nonlinear monotone equations without any merit functions / 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 PRP type method for systems of monotone equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A globally convergent derivative-free method for solving large-scale nonlinear monotone equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of derivative-free methods for large-scale nonlinear monotone equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two derivative-free projection approaches for systems of large-scale nonlinear monotone equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Liu-Storey-Type Method for Solving Large-Scale Nonlinear Monotone 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: Nonmonotone Spectral Methods for Large-Scale Nonlinear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral gradient projection method for solving nonlinear monotone equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral gradient projection method for monotone nonlinear equations with convex constraints / 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: Spectral conjugate gradient methods with sufficient descent property for large-scale unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient descent nonlinear conjugate gradient methods with conjugacy condition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5563083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The conjugate gradient method in extremal problems / 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: The Limited Memory Conjugate Gradient Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods of conjugate gradients for solving linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A projection method for a system of nonlinear monotone equations with convex constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multivariate spectral gradient projection method for nonlinear monotone equations with convex constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank

Latest revision as of 04:40, 18 July 2024

scientific article
Language Label Description Also known as
English
Sufficient descent conjugate gradient methods for solving convex constrained nonlinear monotone equations
scientific article

    Statements

    Sufficient descent conjugate gradient methods for solving convex constrained nonlinear monotone equations (English)
    0 references
    0 references
    0 references
    0 references
    14 February 2019
    0 references
    Summary: Two unified frameworks of some sufficient descent conjugate gradient methods are considered. Combined with the hyperplane projection method of Solodov and Svaiter, they are extended to solve convex constrained nonlinear monotone equations. Their global convergence is proven under some mild conditions. Numerical results illustrate that these methods are efficient and can be applied to solve large-scale nonsmooth equations.
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers