Projection-free accelerated method for convex optimization
From MaRDI portal
Recommendations
- Subgradient method with feasible inexact projections for constrained convex optimization problems
- Conditional gradient sliding for convex optimization
- First-order methods for convex optimization
- Inexact primal-dual gradient projection methods for nonlinear optimization on convex set
- An adaptive accelerated first-order method for convex 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
- An accelerated HPE-type algorithm for a class of composite convex-concave saddle-point problems
- An accelerated non-Euclidean hybrid proximal extragradient-type algorithm for convex-concave saddle-point problems
- An adaptive accelerated first-order method for convex optimization
- Conditional gradient algorithms for norm-regularized smooth convex optimization
- Conditional gradient algorithms for rank-one matrix approximations with a sparsity constraint
- Conditional gradient sliding for convex optimization
- Convergence Rates for Conditional Gradient Sequences Generated by Implicit Step Length Rules
- Duality between subgradient and conditional gradient methods
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- Introductory lectures on convex optimization. A basic course.
- On lower complexity bounds for large-scale smooth convex optimization
- Smooth minimization of non-smooth functions
Cited in
(8)- Accelerated gradient-free optimization methods with a non-Euclidean proximal operator
- Computational acceleration of projection algorithms for the linear best approximation problem
- Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping
- Inexact gradient projection method with relative error tolerance
- Frank--Wolfe Methods with an Unbounded Feasible Region and Applications to Structured Learning
- Universal Conditional Gradient Sliding for Convex Optimization
- Approximate Douglas-Rachford algorithm for two-sets convex feasibility problems
- Fast proximity-gradient algorithms for structured convex optimization problems
This page was built for publication: Projection-free accelerated method for convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5038178)
