New hybrid conjugate gradient projection method for the convex constrained equations
From MaRDI portal
Publication:331803
DOI10.1007/S10092-015-0154-ZzbMATH Open1357.65078OpenAlexW1159291337MaRDI QIDQ331803FDOQ331803
Publication date: 27 October 2016
Published in: Calcolo (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10092-015-0154-z
Recommendations
- A new conjugate gradient projection method for convex constrained nonlinear equations
- A conjugate gradient projection method for solving equations with convex constraints
- scientific article; zbMATH DE number 6310859
- A hybrid three-term conjugate gradient projection method for constrained nonlinear monotone equations with applications
- New hybrid conjugate gradient method for unconstrained optimization
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30)
Cites Work
- Function minimization by conjugate gradients
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- Methods of conjugate gradients for solving linear systems
- Spectral gradient projection method for monotone nonlinear equations with convex constraints
- A projection method for a system of nonlinear monotone equations with convex constraints
- Spectral gradient projection method for solving nonlinear monotone equations
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Title not available (Why is that?)
- The convergence properties of some new conjugate gradient methods
- A PRP type method for systems of monotone equations
- A note about WYL's conjugate gradient method and its applications
- A conjugate gradient method to solve convex constrained monotone equations with applications in compressive sensing
- A self-adaptive three-term conjugate gradient method for monotone nonlinear equations with convex constraints
- A methodology for solving chemical equilibrium systems
- A proximal decomposition algorithm for variational inequality problems.
- Sufficient descent conjugate gradient methods for solving convex constrained nonlinear monotone equations
- A hybrid conjugate gradient method with descent property for unconstrained optimization
- Three derivative-free projection methods for nonlinear equations with convex constraints
- Wei-Yao-Liu conjugate gradient projection algorithm for nonlinear monotone equations with convex constraints
Cited In (44)
- A globally convergent matrix-free method for constrained equations and its linear convergence rate
- New hybrid conjugate gradient method as a convex combination of LS and CD methods
- A derivative‐free projection method for nonlinear equations with non‐Lipschitz operator: Application to LASSO problem
- An efficient conjugate gradient-based algorithm for unconstrained optimization and its projection extension to large-scale constrained nonlinear equations with applications in signal recovery and image denoising problems
- Modified optimal Perry conjugate gradient method for solving system of monotone equations with applications
- An efficient inertial subspace minimization CG algorithm with convergence rate analysis for constrained nonlinear monotone equations
- An accelerated relaxed-inertial strategy based CGP algorithm with restart technique for constrained nonlinear pseudo-monotone equations to image de-blurring problems
- Hybrid algorithm for system of nonlinear monotone equations based on the convex combination of Fletcher-Reeves and a new conjugate residual parameters
- A new projected variant of the deflated block conjugate gradient method
- A new hybrid CGPM-based algorithm for constrained nonlinear monotone equations with applications
- A solution method for nonlinear monotone equations via hybrid spectral conjugate gradient and signal recovery problems
- Two improved conjugate gradient methods with application in compressive sensing and motion control
- A sufficient descent LS-PRP-BFGS-like method for solving nonlinear monotone equations with application to image restoration
- Two-step inertial derivative-free projection method for solving nonlinear equations with application
- A conjugate gradient projection method with restart procedure for solving constraint equations and image restorations
- Globally convergent three-term conjugate gradient projection methods for solving nonlinear monotone equations
- A scaled derivative-free projection method for solving nonlinear monotone equations
- A modified PRP projection method for nonlinear equations with convex constraints
- A family of three-term conjugate gradient projection methods with a restart procedure and their relaxed-inertial extensions for the constrained nonlinear pseudo-monotone equations with applications
- A generalized hybrid CGPM-based algorithm for solving large-scale convex constrained equations with applications to image restoration
- A derivative-free three-term Hestenes–Stiefel type method for constrained nonlinear equations and image restoration
- An efficient projection-based algorithm without Lipschitz continuity for large-scale nonlinear pseudo-monotone equations
- A nonmonotone projection method for constrained system of nonlinear equations
- Partially symmetrical derivative-free Liu-Storey projection method for convex constrained equations
- A descent Dai-Liao projection method for convex constrained nonlinear monotone equations with applications
- An improved inertial projection method for solving convex constrained monotone nonlinear equations with applications
- A new conjugate gradient projection method for convex constrained nonlinear equations
- An inertial three-term hybrid CG-based projection method for constrained nonlinear pseudo-Monotone equations with applications
- 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 hybrid direct search and projected simplex gradient method for convex constrained minimization
- A class of derivative-free CG projection methods for nonsmooth equations with an application to the LASSO problem
- A new hybrid projection algorithm for solving systems of equations
- A conjugate gradient projection method for solving equations with convex constraints
- A family of inertial derivative-free projection methods for constrained nonlinear pseudo-monotone equations with applications
- Discrete-time Zhang neural networks for time-varying nonlinear optimization
- Least-squares-based three-term conjugate gradient methods
- A two-step relaxed-inertial derivative-free projection based algorithm for solving standard nonlinear pseudo-monotone equations and logistic regression problems
- Derivative-free RMIL conjugate gradient method for convex constrained equations
- A subspace derivative-free projection method for convex constrained nonlinear equations
- New three-term conjugate gradient algorithm for solving monotone nonlinear equations and signal recovery problems
- A three-term CGPM-based algorithm without Lipschitz continuity for constrained nonlinear monotone equations with applications
- Title not available (Why is that?)
- Secant-inexact projection algorithms for solving a new class of constrained mixed generalized equations problems
Uses Software
This page was built for publication: New hybrid conjugate gradient projection method for the convex constrained equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q331803)
