A self-adaptive three-term conjugate gradient method for monotone nonlinear equations with convex constraints

DOI10.1007/s10092-015-0140-5zbMath1338.90459OpenAlexW1980592241MaRDI QIDQ295355

Xi Peng Kou, Sheng Jie Li, Xueyong Wang

Publication date: 13 June 2016

Published in: Calcolo (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10092-015-0140-5

zbMATH Keywords

conjugate gradient methodnonlinear equationsconvex constraintslarge-scale problemsself-adaptive method

Mathematics Subject Classification ID

Nonlinear programming (90C30) Methods of reduced gradient type (90C52)

Related Items (26)

A hybrid approach for finding approximate solutions to constrained nonlinear monotone operator equations with applications ⋮ New hybrid conjugate gradient projection method for the convex constrained equations ⋮ A unified derivative-free projection method model for large-scale nonlinear equations with convex constraints ⋮ A modified Dai-Kou-type method with applications to signal reconstruction and blurred image restoration ⋮ A scaled derivative-free projection method for solving nonlinear monotone equations ⋮ A family of inertial derivative-free projection methods for constrained nonlinear pseudo-monotone equations with applications ⋮ An Accelerated Three-Term Extension of a Descent Nonlinear Conjugate Gradient Method ⋮ A derivative-free scaling memoryless DFP method for solving large scale nonlinear monotone equations ⋮ Nonmonotone quasi-Newton-based conjugate gradient methods with application to signal processing ⋮ Modified Dai-Zuan iterative scheme for nonlinear systems and its application ⋮ A Five-Parameter Class of Derivative-Free Spectral Conjugate Gradient Methods for Systems of Large-Scale Nonlinear Monotone Equations ⋮ A descent extension of a modified Polak-Ribière-Polyak method with application in image restoration problem ⋮ Global convergence via modified self-adaptive approach for solving constrained monotone nonlinear equations with application to signal recovery problems ⋮ Modified three-term derivative-free projection method for solving nonlinear monotone equations with application ⋮ An accelerated conjugate gradient algorithm for solving nonlinear monotone equations and image restoration problems ⋮ Global convergence via descent modified three-term conjugate gradient projection algorithm with applications to signal recovery ⋮ An efficient three-term conjugate gradient method for nonlinear monotone equations with convex constraints ⋮ A derivative-free three-term projection algorithm involving spectral quotient for solving nonlinear monotone equations ⋮ A new hybrid PRPFR conjugate gradient method for solving nonlinear monotone equations and image restoration problems ⋮ A modified three-term type CD conjugate gradient algorithm for unconstrained optimization problems ⋮ An adaptive family of projection methods for constrained monotone nonlinear equations with applications ⋮ A diagonal PRP-type projection method for convex constrained nonlinear monotone equations ⋮ A hybrid three-term conjugate gradient projection method for constrained nonlinear monotone equations with applications ⋮ Self adaptive spectral conjugate gradient method for solving nonlinear monotone equations ⋮ An efficient three-term conjugate gradient-based algorithm involving spectral quotient for solving convex constrained monotone nonlinear equations with applications ⋮ Dai-Liao extensions of a descent hybrid nonlinear conjugate gradient method with application in signal processing

Uses Software

• STRSCNE
• CUTEr
• levmar
• CUTE

Cites Work

• Unnamed Item
• Proximal-like contraction methods for monotone variational inequalities in a unified framework. II: General methods and numerical experiments
• Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization
• Modified extragradient method for variational inequalities and verification of solution existence
• A multivariate spectral projected gradient method for bound constrained optimization
• Levenberg--Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints
• A superlinearly convergent projection method for constrained systems of nonlinear equations
• Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
• A new modified Goldstein-Levitin-Polyak projection method for variational inequality problems
• STRSCNE: a scaled trust-region solver for constrained nonlinear equations
• A conjugate gradient method to solve convex constrained monotone equations with applications in compressive sensing
• A smoothing conjugate gradient method for solving systems of nonsmooth equations
• A projection method for a system of nonlinear monotone equations with convex constraints
• A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization
• A Three-Term Conjugate Gradient Method with Sufficient Descent Property for Unconstrained Optimization
• A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
• A self-adaptive projection method for solving the multiple-sets split feasibility problem
• A New Projection Method for Variational Inequality Problems
• CUTE
• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• Some descent three-term conjugate gradient methods and their global convergence
• Benchmarking optimization software with performance profiles.

This page was built for publication: A self-adaptive three-term conjugate gradient method for monotone nonlinear equations with convex constraints