A self-adaptive three-term conjugate gradient method for monotone nonlinear equations with convex constraints
From MaRDI portal
Publication:295355
DOI10.1007/S10092-015-0140-5zbMATH Open1338.90459OpenAlexW1980592241MaRDI QIDQ295355FDOQ295355
S. J. Li, Xueyong Wang, Xipeng Kou
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
Recommendations
- An efficient three-term conjugate gradient method for nonlinear monotone equations with convex constraints
- Self adaptive spectral conjugate gradient method for solving nonlinear monotone equations
- Spectral three-term conjugate descent method for solving nonlinear monotone equations with convex constraints
- A new derivative-free SCG-type projection method for nonlinear monotone equations with convex constraints
- Globally convergent three-term conjugate gradient projection methods for solving nonlinear monotone equations
nonlinear equationsconjugate gradient methodconvex constraintslarge-scale problemsself-adaptive method
Cites Work
- STRSCNE: a scaled trust-region solver for constrained nonlinear equations
- CUTE
- Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
- Benchmarking optimization software with performance profiles.
- 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
- Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- Some descent three-term conjugate gradient methods and their global convergence
- A projection method for a system of nonlinear monotone equations with convex constraints
- Levenberg--Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints
- A self-adaptive projection method for solving the multiple-sets split feasibility problem
- A New Projection Method for Variational Inequality Problems
- Modified extragradient method for variational inequalities and verification of solution existence
- A survey of nonlinear conjugate gradient methods
- A new modified Goldstein-Levitin-Polyak projection method for variational inequality problems
- 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 family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization
- Proximal-like contraction methods for monotone variational inequalities in a unified framework. II: General methods and numerical experiments
- A multivariate spectral projected gradient method for bound constrained optimization
- A superlinearly convergent projection method for constrained systems of nonlinear equations
Cited In (37)
- A new three-term conjugate gradient-based projection method for solving large-scale nonlinear monotone equations
- Dai-Liao extensions of a descent hybrid nonlinear conjugate gradient method with application in signal processing
- A Five-Parameter Class of Derivative-Free Spectral Conjugate Gradient Methods for Systems of Large-Scale Nonlinear Monotone Equations
- A hybrid BFGS-like method for monotone operator equations with applications
- An accelerated relaxed-inertial strategy based CGP algorithm with restart technique for constrained nonlinear pseudo-monotone equations to image de-blurring problems
- A new hybrid PRPFR conjugate gradient method for solving nonlinear monotone equations and image restoration problems
- An efficient three-term conjugate gradient-based algorithm involving spectral quotient for solving convex constrained monotone nonlinear equations with applications
- Two classes of spectral three-term derivative-free method for solving nonlinear equations with application
- An adaptive projection algorithm for solving nonlinear monotone equations with convex constraints
- A derivative-free scaling memoryless DFP method for solving large scale nonlinear monotone equations
- A modified three-term type CD conjugate gradient algorithm for unconstrained optimization problems
- An efficient projection algorithm for solving convex constrained monotone operator equations and sparse signal reconstruction problems
- An accelerated conjugate gradient algorithm for solving nonlinear monotone equations and image restoration problems
- Modification of a conjugate gradient approach for convex constrained nonlinear monotone equations with applications in signal recovery and image restoration
- A scaled derivative-free projection method for solving nonlinear monotone equations
- An Accelerated Three-Term Extension of a Descent Nonlinear Conjugate Gradient Method
- Correction to: ``A self-adaptive three-term conjugate gradient method for monotone nonlinear equations with convex constraints
- A diagonal PRP-type projection method for convex constrained nonlinear monotone equations
- 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 inertial three-term hybrid CG-based projection method for constrained nonlinear pseudo-Monotone equations with applications
- An adaptive family of projection methods for constrained monotone nonlinear equations with applications
- Self adaptive spectral conjugate gradient method for solving nonlinear monotone equations
- A descent extension of a modified Polak-Ribière-Polyak method with application in image restoration problem
- A unified derivative-free projection method model for large-scale nonlinear equations with convex constraints
- New hybrid conjugate gradient projection method for the convex constrained equations
- A hybrid three-term conjugate gradient projection method for constrained nonlinear monotone equations with applications
- A hybrid approach for finding approximate solutions to constrained nonlinear monotone operator equations with applications
- A modified Dai-Kou-type method with applications to signal reconstruction and blurred image restoration
- A family of inertial derivative-free projection methods for constrained nonlinear pseudo-monotone equations with applications
- Global convergence via descent modified three-term conjugate gradient projection algorithm with applications to signal recovery
- A first order dynamical system and its discretization for a class of variational inequalities
- Modified Dai-Zuan iterative scheme for nonlinear systems and its application
- Nonmonotone quasi-Newton-based conjugate gradient methods with application to signal processing
- Title not available (Why is that?)
- A derivative-free three-term projection algorithm involving spectral quotient for solving nonlinear monotone equations
- An efficient three-term conjugate gradient method for nonlinear monotone equations with convex constraints
Uses Software
This page was built for publication: A self-adaptive three-term conjugate gradient method for monotone nonlinear equations with convex constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q295355)
