Conditional gradient sliding for convex optimization
From MaRDI portal
Recommendations
- Conditional gradient type methods for composite nonlinear and stochastic optimization
- Gradient sliding for composite optimization
- Accelerated gradient sliding for structured convex optimization
- Conditional Gradient Methods for Convex Optimization with General Affine and Nonlinear Constraints
- A Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic Optimization
Cites work
- A conditional gradient method with linear rate of convergence for solving convex linear systems
- A generalized conditional gradient method and its connection to an iterative shrinkage method
- A Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic Optimization
- A modified Frank--Wolfe algorithm for computing minimum-area enclosing ellipsoidal cylinders: theory and algorithms
- Accelerated and inexact forward-backward algorithms
- An optimal method for stochastic composite optimization
- Conditional gradient algorithms for norm-regularized smooth convex optimization
- Conditional gradient algorithms for rank-one matrix approximations with a sparsity constraint
- Convergence Rates for Conditional Gradient Sequences Generated by Implicit Step Length Rules
- Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
- Dual subgradient algorithms for large-scale nonsmooth learning problems
- Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start
- scientific article; zbMATH DE number 3673045 (Why is no real title available?)
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- Introductory lectures on convex optimization. A basic course.
- Iterated Hard Shrinkage for Minimization Problems with Sparsity Constraints
- Learning kernel-based halfspaces with the 0-1 loss
- Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization
- New analysis and results for the Frank-Wolfe method
- On lower complexity bounds for large-scale smooth convex optimization
- Optimal primal-dual methods for a class of saddle point problems
- Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization I: A Generic Algorithmic Framework
- Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization. II: Shrinking procedures and optimal algorithms
- Positive semidefinite metric learning using boosting-like algorithms
- Signal Recovery by Proximal Forward-Backward Splitting
- Smooth minimization of non-smooth functions
- Sparse Approximate Solutions to Semidefinite Programs
Cited in
(46)- A distributed Frank-Wolfe framework for learning low-rank matrices with the trace norm
- An inexact Newton-like conditional gradient method for constrained nonlinear systems
- Conditional gradient type methods for composite nonlinear and stochastic optimization
- Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
- Newton's method with feasible inexact projections for solving constrained generalized equations
- Generalized stochastic Frank-Wolfe algorithm with stochastic ``substitute gradient for structured convex optimization
- Conditional gradient method for multiobjective optimization
- Alternating conditional gradient method for convex feasibility problems
- Complexity of linear minimization and projection on some sets
- Slide reduction, revisited -- filling the gaps in SVP approximation
- Network manipulation algorithm based on inexact alternating minimization
- Avoiding bad steps in Frank-Wolfe variants
- Restarting Frank-Wolfe: faster rates under Hölderian error bounds
- Oracle complexity separation in convex optimization
- Accelerated gradient sliding for structured convex optimization
- A Newton Frank-Wolfe method for constrained self-concordant minimization
- Inexact Newton method with feasible inexact projections for solving constrained smooth and nonsmooth equations
- Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems
- Frank-Wolfe and friends: a journey into projection-free first-order optimization methods
- Decomposition techniques for bilinear saddle point problems and variational inequalities with affine monotone operators
- Improved complexities for stochastic conditional gradient methods under interpolation-like conditions
- Generalized self-concordant analysis of Frank-Wolfe algorithms
- Zeroth-order nonconvex stochastic optimization: handling constraints, high dimensionality, and saddle points
- Inexact gradient projection method with relative error tolerance
- Gradient sliding for composite optimization
- On the Frank-Wolfe algorithm for non-compact constrained optimization problems
- Projection-free accelerated method for convex optimization
- Subgradient method with feasible inexact projections for constrained convex optimization problems
- Frank--Wolfe Methods with an Unbounded Feasible Region and Applications to Structured Learning
- Stochastic conditional gradient++: (Non)convex minimization and continuous submodular maximization
- Conditional Gradient Methods for Convex Optimization with General Affine and Nonlinear Constraints
- On the nonergodic convergence rate of an inexact augmented Lagrangian framework for composite convex programming
- scientific article; zbMATH DE number 7064051 (Why is no real title available?)
- Reducing the Complexity of Two Classes of Optimization Problems by Inexact Accelerated Proximal Gradient Method
- Block coordinate type methods for optimization and learning
- Universal Conditional Gradient Sliding for Convex Optimization
- Secant-inexact projection algorithms for solving a new class of constrained mixed generalized equations problems
- No-regret dynamics in the Fenchel game: a unified framework for algorithmic convex optimization
- First-order methods for convex optimization
- Approximate Douglas-Rachford algorithm for two-sets convex feasibility problems
- The Continuous Stochastic Gradient Method: Part II -- Application and Numerics
- Using Taylor-approximated gradients to improve the Frank-Wolfe method for empirical risk minimization
- Frank-Wolfe-type methods for a class of nonconvex inequality-constrained problems
- Broyden quasi-Newton secant-type method for solving constrained mixed generalized equations
- Efficient projection-free online convex optimization using stochastic gradients
- A Newton conditional gradient method for constrained nonlinear systems
This page was built for publication: Conditional gradient sliding for convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2816241)
