A modified scaled spectral-conjugate gradient-based algorithm for solving monotone operator equations
From MaRDI portal
Publication:2036038
Summary: This paper proposes a modified scaled spectral-conjugate-based algorithm for finding solutions to monotone operator equations. The algorithm is a modification of the work of \textit{Q. Li} and \textit{B. Zheng} [Numer. Algorithms 87, No. 3, 1343--1367 (2021; Zbl 1471.65052)] in the sense that the uniformly monotone assumption on the operator is relaxed to just monotone. Furthermore, unlike the work of [loc. cit.], the search directions of the proposed algorithm are shown to be descent and bounded independent of the monotonicity assumption. Moreover, the global convergence is established under some appropriate assumptions. Finally, numerical examples on some test problems are provided to show the efficiency of the proposed algorithm compared to that of Li and Zheng [loc. cit.].
Recommendations
- Solving nonlinear monotone operator equations via modified SR1 update
- A modified spectral conjugate gradient projection method for solving nonlinear monotone symmetric equations
- A modified descent Dai-Yuan conjugate gradient method for constraint nonlinear monotone operator equations
- Spectral gradient projection method for solving nonlinear monotone equations
- A modified spectral PRP conjugate gradient projection method for solving large-scale monotone equations and its application in compressed sensing
Cites work
- A Barzilai-Borwein gradient projection method for sparse signal and blurred image restoration
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- A class of conjugate gradient methods for convex constrained monotone equations
- A derivative-free iterative method for nonlinear monotone equations with convex constraints
- A descent Dai-Liao projection method for convex constrained nonlinear monotone equations with applications
- A descent derivative-free algorithm for nonlinear monotone equations with convex constraints
- A Globally and Superlinearly Convergent Gauss--Newton-Based BFGS Method for Symmetric Nonlinear Equations
- A globally convergent BFGS method for nonlinear monotone equations without any merit functions
- A methodology for solving chemical equilibrium systems
- A modified Perry's conjugate gradient method-based derivative-free method for solving large-scale nonlinear monotone equations
- A nonconvex approach for phase retrieval: reshaped Wirtinger flow and incremental algorithms
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A note on the spectral gradient projection method for nonlinear monotone equations with applications
- A positive spectral gradient-like method for large-scale nonlinear monotone equations
- A spectral conjugate gradient method for unconstrained optimization
- A spectral DY-type projection method for nonlinear monotone system of equations
- Algorithms and applications for approximate nonnegative matrix factorization
- An efficient gradient-free projection algorithm for constrained nonlinear equations and image restoration
- An Efficient Implementation of Merrill’s Method for Sparse or Partially Separable Systems of Nonlinear Equations
- Benchmarking optimization software with performance profiles.
- Derivative-free conjugate residual algorithms for convex constraints nonlinear monotone equations and signal recovery
- FR-type algorithm for finding approximate solutions to nonlinear monotone operator equations
- Globally convergent modified Perry's conjugate gradient method
- scientific article; zbMATH DE number 1306984 (Why is no real title available?)
- Phase retrieval via Wirtinger flow: theory and algorithms
- PRP-like algorithm for monotone operator equations
- Scaled three-term derivative-free methods for solving large-scale nonlinear monotone equations
- Shrinking projection method for solving zero point and fixed point problems in Banach spaces
- Spectral conjugate gradient like method for signal reconstruction
- Spectral gradient projection method for monotone nonlinear equations with convex constraints
- Spectral gradient projection method for solving nonlinear monotone equations
- Spectral residual method without gradient information for solving large-scale nonlinear systems of equations
- Superlinear convergence of a Newton-type algorithm for monotone equations
- Two families of scaled three-term conjugate gradient methods with sufficient descent property for nonconvex optimization
Cited in
(7)- A method with inertial extrapolation step for convex constrained monotone equations
- Projection method with inertial step for nonlinear equations: application to signal recovery
- An efficient DY-type spectral conjugate gradient method for system of nonlinear monotone equations with application in signal recovery
- Solving nonlinear monotone operator equations via modified SR1 update
- A three-term inertial derivative-free projection method for convex constrained monotone equations
- A new black box method for monotone nonlinear equations
- Modified Dai-Yuan conjugate gradient method with sufficient descent property for nonlinear equations
This page was built for publication: A modified scaled spectral-conjugate gradient-based algorithm for solving monotone operator equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2036038)
