Supermemory gradient methods for monotone nonlinear equations with convex constraints
From MaRDI portal
Publication:520272
DOI10.1007/s40314-015-0228-1zbMath1359.90136OpenAlexW1984506280MaRDI QIDQ520272
Publication date: 3 April 2017
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-015-0228-1
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10)
Related Items (7)
A unified derivative-free projection method model for large-scale nonlinear equations with convex constraints ⋮ A derivative-free multivariate spectral projection algorithm for constrained nonlinear monotone equations ⋮ A framework for convex-constrained monotone nonlinear equations and its special cases ⋮ A new conjugate gradient projection method for convex constrained nonlinear equations ⋮ Unnamed Item ⋮ A diagonal PRP-type projection method for convex constrained nonlinear monotone equations ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Two derivative-free projection approaches for systems of large-scale nonlinear monotone equations
- A projected gradient trust-region method for solving nonlinear systems with convex constraints
- A nonmonotone supermemory gradient algorithm for unconstrained optimization
- Global convergence of a memory gradient method for unconstrained optimization
- A globally convergent derivative-free method for solving large-scale nonlinear monotone equations
- A new supermemory gradient method for unconstrained optimization problems
- A smoothing projected Newton-type method for semismooth equations with bound constraints
- A new descent memory gradient method and its global convergence
- On the Levenberg-Marquardt methods for convex constrained nonlinear equations
- 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
- A new super-memory gradient method with curve search rule
- Monotonicity of Fixed Point and Normal Mappings Associated with Variational Inequality and Its Application
- A class of derivative-free methods for large-scale nonlinear monotone equations
- A New Projection Method for Variational Inequality Problems
- Numerical Optimization
- Newton-type Methods with Generalized Distances For Constrained Optimization
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- Benchmarking optimization software with performance profiles.
This page was built for publication: Supermemory gradient methods for monotone nonlinear equations with convex constraints
