Pages that link to "Item:Q692728"
From MaRDI portal
The following pages link to A new subspace correction method for nonlinear unconstrained convex optimization problems (Q692728):
Displaying 6 items.
- A subspace conjugate gradient algorithm for large-scale unconstrained optimization (Q1681785) (← links)
- Efficient algorithms for solving the \(p\)-Laplacian in polynomial time (Q2209522) (← links)
- A new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimization (Q2413500) (← links)
- A parallel line search subspace correction method for composite convex optimization (Q2516372) (← links)
- Global and uniform convergence of subspace correction methods for some convex optimization problems (Q2759087) (← links)
- A General Two-Level Subspace Method for Nonlinear Optimization (Q5381497) (← links)