First-order methods of smooth convex optimization with inexact oracle

2013/06/13 by Olivier Devolder, François Glineur, Yurii Nesterov · 35 citations
Computer Science · Engineering · Mathematics · #Stochastic Gradient Optimization Techniques #Sparse and Compressive Sensing Techniques #Advanced Optimization Algorithms Research

paper · doi:10.1007/s10107-013-0677-5

Citations

• Smooth minimization of non-smooth functions

Cited by

• Analysis of biased stochastic gradient descent using sequential semidefinite programs
• Improved Optimization of Finite Sums with Minibatch Stochastic Variance Reduced Proximal Iterations
• Learning Deep Neural Networks under Agnostic Corrupted Supervision
• A New Class of Composite Objective Multi-step Estimating-sequence Techniques (COMET)
• Non-smooth Variable Projection
• Structured Nonconvex and Nonsmooth Optimization: Algorithms and Iteration Complexity Analysis
• A perturbed preconditioned gradient descent method for the unconstrained minimization of composite objectives
• A Class of Accelerated Fixed-Point-Based Methods with Delayed Inexact Oracles and Its Applications
• Implicit Regularization of Accelerated Methods in Hilbert Spaces
• OFF (Proximal) Newton-type Methods with Inexact Derivatives for Unconstrained Optimization
• Generalization of Silver Stepsize Schedule to Stochastic Optimization
• Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems
• Global convergence rate analysis of unconstrained optimization methods\n based on probabilistic models
• Gradient-Variation Online Adaptivity for Accelerated Optimization with Hölder Smoothness
• Analysis of Biased Stochastic Gradient Descent Using Sequential Semidefinite Programs
• Target Propagation via Regularized Inversion
• Decentralized Stochastic Gradient Langevin Dynamics and Hamiltonian\n Monte Carlo
• Iteration complexity of first-order augmented Lagrangian methods for convex conic programming
• Subgradient Methods for Nonsmooth Convex Functions with Adversarial Errors
• Projection Efficient Subgradient Method and Optimal Nonsmooth Frank-Wolfe Method
• Momentum-inspired Low-Rank Coordinate Descent for Diagonally Constrained SDPs
• Making Non-Stochastic Control (Almost) as Easy as Stochastic
• Communication-Efficient Algorithms For Distributed Optimization
• Improving Fast Dual Ascent for MPC - Part I: The Distributed Case
• Universal Complexity Bounds for Universal Gradient Methods in Nonlinear Optimization
• Truncated Inference for Latent Variable Optimization Problems: Application to Robust Estimation and Learning
• Выпуклая оптимизация
• Accelerated Gradient Methods with Biased Gradient Estimates: Risk Sensitivity, High-Probability Guarantees, and Large Deviation Bounds
• Online Optimization with Predictions and Switching Costs: Fast Algorithms and the Fundamental Limit
• Convexity of Optimization Curves: Local Sharp Thresholds, Robustness Impossibility, and New Counterexamples
• Langevin Monte Carlo without smoothness
• Convergence and Stability of the Stochastic Proximal Point Algorithm\n with Momentum
• Minimax Excess Risk of First-Order Methods for Statistical Learning with Data-Dependent Oracles
• A Universally Optimal Multistage Accelerated Stochastic Gradient Method
• Generalized Mirror Prox for Monotone Variational Inequalities:\n Universality and Inexact Oracle