Pages that link to "Item:Q415377"
From MaRDI portal
The following pages link to Approximate level method for nonsmooth convex minimization (Q415377):
Displaying 6 items.
- A regularized simplex method (Q302140) (← links)
- A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints (Q461437) (← links)
- Level bundle-like algorithms for convex optimization (Q743968) (← links)
- Machine learning algorithms of relaxation subgradient method with space extension (Q2117655) (← links)
- Fast bundle-level methods for unconstrained and ball-constrained convex optimization (Q2419544) (← links)
- Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization (Q2515032) (← links)
