An optimal subgradient algorithm with subspace search for costly convex optimization problems
From MaRDI portal
Publication:2415906
Recommendations
- An optimal subgradient algorithm for large-scale bound-constrained convex optimization
- OSGA: a fast subgradient algorithm with optimal complexity
- Optimal subgradient algorithms for large-scale convex optimization in simple domains
- A subgradient method based on gradient sampling for solving convex optimization problems
- Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\)
Cites work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A Majorize–Minimize Strategy for Subspace Optimization Applied to Image Restoration
- A subspace implementation of quasi-Newton trust region methods for unconstrained optimization
- A Subspace Study on Conjugate Gradient Algorithms
- A subspace version of the Powell-Yuan trust-region algorithm for equality constrained optimization
- An Optimal Algorithm for Constrained Differentiable Convex Optimization
- An optimal subgradient algorithm for large-scale bound-constrained convex optimization
- Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization
- Coordinate and subspace optimization methods for linear least squares with non-quadratic regularization
- Cutting-plane training of structural SVMs
- Fine tuning Nesterov's steepest descent algorithm for differentiable convex programming
- First-order methods of smooth convex optimization with inexact oracle
- Gradient methods for minimizing composite functions
- scientific article; zbMATH DE number 992793 (Why is no real title available?)
- scientific article; zbMATH DE number 3850830 (Why is no real title available?)
- scientific article; zbMATH DE number 4164577 (Why is no real title available?)
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- scientific article; zbMATH DE number 1314294 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 3894826 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
- Introductory lectures on convex optimization. A basic course.
- Memory gradient method for the minimization of functions
- Minimization Techniques for Piecewise Differentiable Functions: The l₁ Solution to an Overdetermined Linear System
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- On the limited memory BFGS method for large scale optimization
- Optimal subgradient algorithms for large-scale convex optimization in simple domains
- Optimal subgradient methods: computational properties for large-scale linear inverse problems
- Optimization with sparsity-inducing penalties
- OSGA: a fast subgradient algorithm with optimal complexity
- Pegasos: primal estimated sub-gradient solver for SVM
- Primal Methods are Better than Dual Methods for Solving Overdetermined Linear Systems in the $l_\infty $ Sense?
- Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming
- Smooth minimization of non-smooth functions
- Solving Ill-Conditioned and Singular Linear Systems: A Tutorial on Regularization
- Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\)
- Study on a supermemory gradient method for the minimization of functions
- Subspace techniques for nonlinear optimization
- Universal gradient methods for convex optimization problems
Cited in
(7)- A computational evaluation of two subgradient search methods
- Optimal subgradient algorithms for large-scale convex optimization in simple domains
- Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\)
- Optimal subgradient methods: computational properties for large-scale linear inverse problems
- An optimal subgradient algorithm for large-scale bound-constrained convex optimization
- A parallel line search subspace correction method for composite convex optimization
- OSGA: a fast subgradient algorithm with optimal complexity
This page was built for publication: An optimal subgradient algorithm with subspace search for costly convex optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2415906)
