Pages that link to "Item:Q520272"
From MaRDI portal
The following pages link to Supermemory gradient methods for monotone nonlinear equations with convex constraints (Q520272):
Displaying 12 items.
- A diagonal PRP-type projection method for convex constrained nonlinear monotone equations (Q2031317) (← links)
- A unified derivative-free projection method model for large-scale nonlinear equations with convex constraints (Q2165796) (← links)
- A new conjugate gradient projection method for convex constrained nonlinear equations (Q2205252) (← links)
- Convergence of supermemory gradient method (Q2454990) (← links)
- A generalized super-memory gradient projection method of strongly sub-feasible directions with strong convergence for nonlinear inequality constrained optimization (Q2460608) (← links)
- A derivative-free multivariate spectral projection algorithm for constrained nonlinear monotone equations (Q2669864) (← links)
- (Q3385422) (← links)
- (Q4381221) (← links)
- (Q4663258) (← links)
- A Family of Supermemory Gradient Projection Methods for Constrained Optimization (Q4805781) (← links)
- (Q5123967) (← links)
- A framework for convex-constrained monotone nonlinear equations and its special cases (Q6056615) (← links)