Improved algorithms for convex minimization in relative scale
From MaRDI portal
Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Large-scale problems in mathematical programming (90C06) Convex programming (90C25) Minimax problems in mathematical programming (90C47) Abstract computational complexity for mathematical programming problems (90C60)
Recommendations
- Unconstrained convex minimization in relative scale
- New Proximal Point Algorithms for Convex Minimization
- Gradient methods for minimizing composite functions
- Optimized first-order methods for smooth convex minimization
- Fine tuning Nesterov's steepest descent algorithm for differentiable convex programming
Cited in
(14)- Fine tuning Nesterov's steepest descent algorithm for differentiable convex programming
- Decomposition in derivative-free optimization
- Performance of first-order methods for smooth convex minimization: a novel approach
- A secant-based Nesterov method for convex functions
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- Rescaled pure greedy algorithm for convex optimization
- Low-rank spectral optimization via gauge duality
- OSGA: a fast subgradient algorithm with optimal complexity
- Unconstrained convex minimization in relative scale
- Approximate level method for nonsmooth convex minimization
- Rank-two update algorithms for the minimum volume enclosing ellipsoid problem
- scientific article; zbMATH DE number 2086911 (Why is no real title available?)
- Nesterov's Method for Convex Optimization
- Branch-and-Model: a derivative-free global optimization algorithm
This page was built for publication: Improved algorithms for convex minimization in relative scale
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3105793)
