Duality Between Subgradient and Conditional Gradient Methods
From MaRDI portal
Publication:2954379
DOI10.1137/130941961zbMath1358.90155arXiv1211.6302OpenAlexW2964177174MaRDI QIDQ2954379
Publication date: 13 January 2017
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1211.6302
Large-scale problems in mathematical programming (90C06) Optimality conditions and duality in mathematical programming (90C46) Methods of reduced gradient type (90C52)
Related Items
Projection-free accelerated method for convex optimization, The Cyclic Block Conditional Gradient Method for Convex Optimization Problems, New results on subgradient methods for strongly convex optimization problems with a unified analysis, Optimal complexity and certification of Bregman first-order methods, Screening for a reweighted penalized conditional gradient method, Submodular functions: from discrete to continuous domains, Analysis of the Frank-Wolfe method for convex composite optimization involving a logarithmically-homogeneous barrier, Riemannian optimization via Frank-Wolfe methods, Inexact successive quadratic approximation for regularized optimization, Affine Invariant Convergence Rates of the Conditional Gradient Method, A generalized conditional gradient method for dynamic inverse problems with optimal transport regularization, Short paper -- A note on the Frank-Wolfe algorithm for a class of nonconvex and nonsmooth optimization problems, The Frank-Wolfe algorithm: a short introduction, Stochastic incremental mirror descent algorithms with Nesterov smoothing, Perturbed Fenchel duality and first-order methods, A generalized Frank-Wolfe method with ``dual averaging for strongly convex composite optimization, Methodology and first-order algorithms for solving nonsmooth and non-strongly convex bilevel optimization problems, First-order methods for convex optimization, Revisiting the approximate Carathéodory problem via the Frank-Wolfe algorithm, Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis, Level-set methods for convex optimization, Primal and dual predicted decrease approximation methods, Generalized stochastic Frank-Wolfe algorithm with stochastic ``substitute gradient for structured convex optimization, Low-Rank Spectral Optimization via Gauge Duality, Generalized Conditional Gradient with Augmented Lagrangian for Composite Minimization, Sparse Inverse Problems over Measures: Equivalence of the Conditional Gradient and Exchange Methods, Efficient Relaxations for Dense CRFs with Sparse Higher-Order Potentials, Generalized Conditional Gradient for Sparse Estimation, Distributed block-diagonal approximation methods for regularized empirical risk minimization, On the Effectiveness of Richardson Extrapolation in Data Science
