Splitting the conditional gradient algorithm
From MaRDI portal
Cites work
- A projection-free method for solving convex bilevel optimization problems
- A regularization of the Frank-Wolfe method and unification of certain nonlinear programming methods
- Alternating conditional gradient method for convex feasibility problems
- Bayesian constraint relaxation
- Complexity of linear minimization and projection on some sets
- Conditional Gradient Methods for Convex Optimization with General Affine and Nonlinear Constraints
- Constrained Minkowski sums: A geometric framework for solving interval problems in computational biology efficiently
- Convex analysis and monotone operator theory in Hilbert spaces
- Decomposition through formalization in a product space
- Generalized conditional gradient with augmented Lagrangian for composite minimization
- Graph refinement via simultaneously low-rank and sparse approximation
- Improved complexities of conditional gradient-type methods with applications to robust matrix recovery problems
- Low-rank doubly stochastic matrix decomposition for cluster analysis
- Mixed Frank-Wolfe penalty method with applications to nonconvex optimal control problems
- On the nonergodic convergence rate of an inexact augmented Lagrangian framework for composite convex programming
- Projection free methods on product domains
- Projection methods: an annotated bibliography of books and reviews
- Proximal splitting methods in signal processing
- Reconstruction of functions from prescribed proximal points
- Scalable robust matrix recovery: Frank-Wolfe meets proximal methods
- The cyclic block conditional gradient method for convex optimization problems
- The iterates of the Frank-Wolfe algorithm may not converge
- The matching polytope has exponential extension complexity
This page was built for publication: Splitting the conditional gradient algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7019453)
