Supermemory gradient methods for monotone nonlinear equations with convex constraints
From MaRDI portal
(Redirected from Publication:520272)
Recommendations
- A class of conjugate gradient methods for convex constrained monotone equations
- Spectral gradient projection method for monotone nonlinear equations with convex constraints
- Wei-Yao-Liu conjugate gradient projection algorithm for nonlinear monotone equations with convex constraints
- Sufficient descent conjugate gradient methods for solving convex constrained nonlinear monotone equations
- A nonmonotone supermemory gradient algorithm for unconstrained optimization
Cites work
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- A New Projection Method for Variational Inequality Problems
- A class of derivative-free methods for large-scale nonlinear monotone equations
- A conjugate gradient method to solve convex constrained monotone equations with applications in compressive sensing
- A globally convergent derivative-free method for solving large-scale nonlinear monotone equations
- A new descent memory gradient method and its global convergence
- A new super-memory gradient method with curve search rule
- A new supermemory gradient method for unconstrained optimization problems
- A nonmonotone supermemory gradient algorithm for unconstrained optimization
- A projected gradient trust-region method for solving nonlinear systems with convex constraints
- A projection method for a system of nonlinear monotone equations with convex constraints
- A smoothing projected Newton-type method for semismooth equations with bound constraints
- A survey of nonlinear conjugate gradient methods
- Benchmarking optimization software with performance profiles.
- Global convergence of a memory gradient method for unconstrained optimization
- Monotonicity of fixed point and normal mappings associated with variational inequality and its application
- Newton-type Methods with Generalized Distances For Constrained Optimization
- Numerical Optimization
- On the Levenberg-Marquardt methods for convex constrained nonlinear equations
- Spectral gradient projection method for monotone nonlinear equations with convex constraints
- Two derivative-free projection approaches for systems of large-scale nonlinear monotone equations
Cited in
(12)- Hybrid algorithm for system of nonlinear monotone equations based on the convex combination of Fletcher-Reeves and a new conjugate residual parameters
- A new conjugate gradient projection method for convex constrained nonlinear equations
- scientific article; zbMATH DE number 1135750 (Why is no real title available?)
- Convergence of supermemory gradient method
- A diagonal PRP-type projection method for convex constrained nonlinear monotone equations
- A generalized super-memory gradient projection method of strongly sub-feasible directions with strong convergence for nonlinear inequality constrained optimization
- A descent Dai-Liao projection method for convex constrained nonlinear monotone equations with applications
- A derivative-free multivariate spectral projection algorithm for constrained nonlinear monotone equations
- A framework for convex-constrained monotone nonlinear equations and its special cases
- scientific article; zbMATH DE number 2150661 (Why is no real title available?)
- A unified derivative-free projection method model for large-scale nonlinear equations with convex constraints
- A Family of Supermemory Gradient Projection Methods for Constrained Optimization
This page was built for publication: Supermemory gradient methods for monotone nonlinear equations with convex constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q520272)
