Globally convergent three-term conjugate gradient projection methods for solving nonlinear monotone equations
From MaRDI portal
Publication:1630965
DOI10.1007/s40065-018-0206-8zbMath1412.90142OpenAlexW2801147184WikidataQ129857475 ScholiaQ129857475MaRDI QIDQ1630965
Mompati S. Koorapetse, P. Kaelo
Publication date: 5 December 2018
Published in: Arabian Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40065-018-0206-8
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56) Numerical optimization and variational techniques (65K10)
Related Items (8)
A globally convergent projection method for a system of nonlinear monotone equations ⋮ Accelerated Dai-Liao projection method for solving systems of monotone nonlinear equations with application to image deblurring ⋮ Descent Perry conjugate gradient methods for systems of monotone nonlinear equations ⋮ An accelerated conjugate gradient algorithm for solving nonlinear monotone equations and image restoration problems ⋮ A globally convergent derivative-free projection method for nonlinear monotone equations with applications ⋮ A derivative-free \textit{RMIL} conjugate gradient projection method for convex constrained nonlinear monotone equations with applications in compressive sensing ⋮ Self adaptive spectral conjugate gradient method for solving nonlinear monotone equations ⋮ Two descent Dai-Yuan conjugate gradient methods for systems of monotone nonlinear equations
Cites Work
- Unnamed Item
- Unnamed Item
- New hybrid conjugate gradient projection method for the convex constrained equations
- A three-term derivative-free projection method for nonlinear monotone system of equations
- Two derivative-free projection approaches for systems of large-scale nonlinear monotone equations
- Nonlinear conjugate gradient methods with sufficient descent properties for unconstrained optimization
- A modified Hestenes-Stiefel projection method for constrained nonlinear equations and its linear convergence rate
- Levenberg--Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints
- Subspace methods for large scale nonlinear equations and nonlinear least squares
- Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems
- On the convergence of a trust-region method for solving constrained nonlinear equations with degenerate solutions
- A projection method for convex constrained monotone nonlinear equations with applications
- Multivariate spectral DY-type projection method for convex constrained nonlinear monotone equations
- Nonmonotone derivative-free methods for nonlinear equations
- A projection method for a system of nonlinear monotone equations with convex constraints
- Spectral gradient projection method for solving nonlinear monotone equations
- A class of derivative-free methods for large-scale nonlinear monotone equations
- Quasi-Newton Methods, Motivation and Theory
- Newton-type Methods with Generalized Distances For Constrained Optimization
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- Convex programming in Hilbert space
- Benchmarking optimization software with performance profiles.
This page was built for publication: Globally convergent three-term conjugate gradient projection methods for solving nonlinear monotone equations
