Primal-dual subgradient methods for convex problems

2007/06/18 by Yurii Nesterov · 58 citations
Computer Science · Engineering · Mathematics · #Stochastic Gradient Optimization Techniques #Sparse and Compressive Sensing Techniques #Advanced Optimization Algorithms Research

paper · doi:10.1007/s10107-007-0149-x

Citations

• Smooth minimization of non-smooth functions

Cited by

• Sample size selection in optimization methods for machine learning
• Optimization Methods for Large-Scale Machine Learning
• Are Statistical Methods Obsolete in the Era of Deep Learning? A Study of ODE Inverse Problems
• An Isotropic Approach to Efficient Uncertainty Quantification with Gradient Norms
• Numerical methods in large-scale optimization: inexact oracle and primal-dual analysis
• Online AUC Optimization for Sparse High-Dimensional Datasets
• On the Optimal Ergodic Sublinear Convergence Rate of the Relaxed Proximal Point Algorithm for Variational Inequalities
• On the robustness of learning in games with stochastically perturbed\n payoff observations
• Generalized-Hukuhara Subgradient Method for Optimization Problem with Interval-valued Functions and its Application in Lasso Problem
• On the convergence of single-call stochastic extra-gradient methods
• Gradient-free two-points optimal method for non smooth stochastic convex\n optimization problem with additional small noise
• Nonlinear stochastic multiarmed bandit problems with inexact oracle
• A Modular Analysis of Adaptive (Non-)Convex Optimization: Optimism, Composite Objectives, and Variational Bounds
• On the Last Iterate Convergence of Momentum Methods
• On the convergence of dynamic implementations of Hamiltonian Monte Carlo and no U-turn samplers
• Statistical Inference for Model Parameters in Stochastic Gradient Descent
• Robust equilibria in continuous games: From strategic to dynamic robustness
• Multi-agent learning under uncertainty: Recurrence vs. concentration
• Distributed Delayed Stochastic Optimization
• Bayesian Bridge Gaussian Process Regression
• Online Distributed ADMM on Networks
• Adaptive extra-gradient methods for min-max optimization and games
• Online convex optimization and no-regret learning: Algorithms, guarantees and applications
• A Linearly-Convergent Stochastic L-BFGS Algorithm
• Gossip Dual Averaging for Decentralized Optimization of Pairwise\n Functions
• GenAI vs. Human Creators: Procurement Mechanism Design in Two-/Three-Layer Markets
• Minimax Theorems for Possibly Nonconvex Functions
• Frank-Wolfe variants for minimization of a sum of functions
• On the O(1/k) Convergence of Asynchronous Distributed Alternating Direction Method of Multipliers
• Entropy-based adaptive Hamiltonian Monte Carlo
• Federated Composite Optimization
• Online and stochastic Douglas-Rachford splitting method for large scale machine learning
• Tight last-iterate convergence rates for no-regret learning in multi-player games
• Dual subgradient algorithms for large-scale nonsmooth learning problems
• Stochastic First- and Zeroth-order Methods for Nonconvex Stochastic Programming
• Dual Averaging is Surprisingly Effective for Deep Learning Optimization
• Modeling and Analysis of Energy Harvesting and Smart Grid-Powered Wireless Communication Networks: A Contemporary Survey
• Communication-Efficient Algorithms For Distributed Optimization
• Online distributed algorithms for seeking generalized Nash equilibria in dynamic environments
• Online Learning: A Comprehensive Survey
• Universal similar triangulars method for searching equilibriums in\n traffic flow distribution models
• A regret minimization approach to fixed-point iterations
• Online and Stochastic Universal Gradient Methods for Minimizing Regularized Hölder Continuous Finite Sums
• Convex Optimization without Projection Steps
• The No-U-Turn Sampler: Adaptively Setting Path Lengths in Hamiltonian Monte Carlo
• Extragradient method with variance reduction for stochastic variational inequalities
• Searching of equilibriums in hierarchical congestion population games
• Learned convex regularizers for inverse problems
• Sparse Q-learning with Mirror Descent
• Online Learning: A Modern Introduction Using Convex Optimization
• Balancing Communication and Computation in Distributed Optimization
• Convergence Rates of Subgradient Methods for Quasi-convex Optimization Problems
• Stochastic dual averaging methods using variance reduction techniques for regularized empirical risk minimization problems
• Iteratively reweighted ℓ ₁ ℓ 1 algorithms with extrapolation
• Multi-Agent Online Optimization with Delays: Asynchronicity, Adaptivity,\n and Optimism
• No-regret learning and mixed Nash equilibria: They do not mix
• Online Convex Optimization with Heavy Tails: Old Algorithms, New Regrets, and Applications
• Towards an O((1)/(t)) convergence rate for distributed dual averaging