A conjugate gradient projection method for solving equations with convex constraints
From MaRDI portal
Publication:2309250
DOI10.1016/J.CAM.2020.112781zbMath1441.90161OpenAlexW3005779920MaRDI QIDQ2309250
Li Zheng, Lei Yang, Yong Liang
Publication date: 30 March 2020
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2020.112781
Related Items (15)
Two families of hybrid conjugate gradient methods with restart procedures and their applications ⋮ A projection-based derivative free DFP approach for solving system of nonlinear convex constrained monotone equations with image restoration applications ⋮ A derivative‐free projection method for nonlinear equations with non‐Lipschitz operator: Application to LASSO problem ⋮ Accelerated Dai-Liao projection method for solving systems of monotone nonlinear equations with application to image deblurring ⋮ A modified inertial three-term conjugate gradient projection method for constrained nonlinear equations with applications in compressed sensing ⋮ Unnamed Item ⋮ Relaxed-inertial derivative-free algorithm for systems of nonlinear pseudo-monotone equations ⋮ Stabilized BB projection algorithm for large-scale convex constrained nonlinear monotone equations to signal and image processing problems ⋮ A new hybrid CGPM-based algorithm for constrained nonlinear monotone equations with applications ⋮ Two classes of spectral three-term derivative-free method for solving nonlinear equations with application ⋮ A derivative-free memoryless Broyden family projection method for solving nonlinear monotone systems with convex constrains ⋮ A spectral gradient-type derivative-free projection algorithm for solving nonlinear convex constrained equations with its application ⋮ A subspace derivative-free projection method for convex constrained nonlinear equations ⋮ Modified Hager–Zhang conjugate gradient methods via singular value analysis for solving monotone nonlinear equations with convex constraint ⋮ Modified optimal Perry conjugate gradient method for solving system of monotone equations with applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A three-term derivative-free projection method for nonlinear monotone system of equations
- A new inexact alternating directions method for monotone variational inequalities
- Solitons for the (2+1)-dimensional Konopelchenko-Dubrovsky equations
- An efficient three-term conjugate gradient method for nonlinear monotone equations with convex constraints
- Mathematical view with observational/experimental consideration on certain \((2+1)\)-dimensional waves in the cosmic/laboratory dusty plasmas
- Superlinear convergence of a Newton-type algorithm for monotone equations
- A projection method for convex constrained monotone nonlinear equations with applications
- Conservation laws, binary Darboux transformations and solitons for a higher-order nonlinear Schrödinger system
- A conjugate gradient method to solve convex constrained monotone equations with applications in compressive sensing
- An extragradient algorithm for monotone variational inequalities
- Spectral gradient projection method for monotone nonlinear equations with convex constraints
- Quintic time-dependent-coefficient derivative nonlinear Schrödinger equation in hydrodynamics or fiber optics: bilinear forms and dark/anti-dark/gray solitons
- A derivative-free iterative method for nonlinear monotone equations with convex constraints
- 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
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- A globally convergent BFGS method for nonlinear monotone equations without any merit functions
- A class of derivative-free methods for large-scale nonlinear monotone equations
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- Spectral DY-Type Projection Method for Nonlinear Monotone Systems of Equations
- An Efficient Implementation of Merrill’s Method for Sparse or Partially Separable Systems of Nonlinear Equations
- Nonmonotone Spectral Methods for Large-Scale Nonlinear Systems
- An Interior-Point Method for Semidefinite Programming
- Solitons, Bäcklund transformation and Lax pair for a (2+1)-dimensional Davey-Stewartson system on surface waves of finite depth
- Gramian solutions and soliton interactions for a generalized (3 + 1)-dimensional variable-coefficient Kadomtsev–Petviashvili equation in a plasma or fluid
- Some descent three-term conjugate gradient methods and their global convergence
- Spectral residual method without gradient information for solving large-scale nonlinear systems of equations
- Benchmarking optimization software with performance profiles.
This page was built for publication: A conjugate gradient projection method for solving equations with convex constraints
