Pages that link to "Item:Q3105793"
From MaRDI portal
The following pages link to Improved Algorithms for Convex Minimization in Relative Scale (Q3105793):
Displaying 9 items.
- OSGA: a fast subgradient algorithm with optimal complexity (Q304218) (← links)
- Approximate level method for nonsmooth convex minimization (Q415377) (← links)
- Rank-two update algorithms for the minimum volume enclosing ellipsoid problem (Q434159) (← links)
- Fine tuning Nesterov's steepest descent algorithm for differentiable convex programming (Q1949275) (← links)
- Decomposition in derivative-free optimization (Q2231319) (← links)
- Performance of first-order methods for smooth convex minimization: a novel approach (Q2248759) (← links)
- Derivative-free optimization: a review of algorithms and comparison of software implementations (Q2392129) (← links)
- Low-Rank Spectral Optimization via Gauge Duality (Q2811991) (← links)
- Branch-and-Model: a derivative-free global optimization algorithm (Q6097758) (← links)