A modified Hestenes-Stiefel projection method for constrained nonlinear equations and its linear convergence rate
From MaRDI portal
Publication:499978
DOI10.1007/s12190-014-0829-7zbMath1336.65090MaRDI QIDQ499978
Publication date: 7 October 2015
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-014-0829-7
65K05: Numerical mathematical programming methods
90C25: Convex programming
65H10: Numerical computation of solutions to systems of equations
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
Related Items
A derivative-free three-term Hestenes–Stiefel type method for constrained nonlinear equations and image restoration, A projection-based hybrid PRP-DY type conjugate gradient algorithm for constrained nonlinear equations with applications, Globally convergent three-term conjugate gradient projection methods for solving nonlinear monotone equations, A hybrid three-term conjugate gradient projection method for constrained nonlinear monotone equations with applications, A class of derivative-free CG projection methods for nonsmooth equations with an application to the LASSO problem, Discrete-time Zhang neural networks for time-varying nonlinear optimization, A scaled derivative-free projection method for solving nonlinear monotone equations, A generalized hybrid CGPM-based algorithm for solving large-scale convex constrained equations with applications to image restoration, A family of inertial derivative-free projection methods for constrained nonlinear pseudo-monotone equations with applications
Uses Software
Cites Work
- Unnamed Item
- A modified Fletcher-Reeves-type derivative-free method for symmetric nonlinear equations
- Active-set projected trust-region algorithm for box-constrained nonsmooth equations
- A PRP type method for systems of monotone equations
- A feasible semismooth asymptotically Newton method for mixed complementarity problems
- Sufficient descent conjugate gradient methods for solving convex constrained nonlinear monotone equations
- A smoothing projected Newton-type method for semismooth equations with bound constraints
- A class of smoothing functions for nonlinear and mixed complementarity problems
- A conjugate gradient method to solve convex constrained monotone equations with applications in compressive sensing
- 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
- A global convergent quasi-Newton method for systems of monotone equations
- Nonmonotone Trust-Region Methods for Bound-Constrained Semismooth Equations with Applications to Nonlinear Mixed Complementarity Problems
- A globally convergent BFGS method for nonlinear monotone equations without any merit functions
- A NEW PROJECTION ALGORITHM FOR SOLVING A SYSTEM OF NONLINEAR EQUATIONS WITH CONVEX CONSTRAINTS
- Some descent three-term conjugate gradient methods and their global convergence