Asymptotic linear convergence of fully-corrective generalized conditional gradient methods
From MaRDI portal
Publication:6126647
DOI10.1007/s10107-023-01975-zarXiv2110.06756OpenAlexW4384200833MaRDI QIDQ6126647
Silvio Fanzon, Daniel Walter, Kristian Bredies, Marcello Carioni
Publication date: 9 April 2024
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.06756
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(W^{1,p}\)-quasiconvexity and variational problems for multiple integrals
- A generalized conditional gradient method and its connection to an iterative shrinkage method
- Conditional gradient algorithms with open loop step size rules
- The convex geometry of linear inverse problems
- A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problem
- Mathematical image processing. Translated from the German
- Tensor-free proximal methods for lifted bilinear/quadratic inverse problems with applications to phase retrieval
- On the linear convergence rates of exchange and continuous methods for total variation minimization
- Sparsity of solutions for variational inverse problems with finite-dimensional data
- Optimal transport for applied mathematicians. Calculus of variations, PDEs, and modeling
- Sparse initial data identification for parabolic PDE and its finite element approximations
- Restricted simplicial decomposition for convex constrained problems
- PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming
- A minimum effort optimal control problem for elliptic PDEs
- Trading Accuracy for Sparsity in Optimization Problems with Sparsity Constraints
- Minimal Effort Problems and Their Treatment by Semismooth Newton Methods
- Optimal Transport for Particle Image Velocimetry: Real Data and Postprocessing Algorithms
- Iterated Hard Shrinkage for Minimization Problems with Sparsity Constraints
- Some comments on Wolfe's ‘away step’
- Convergence Rates for Conditional Gradient Sequences Generated by Implicit Step Length Rules
- A GENERAL ATOMIC DECOMPOSITION THEOREM AND BANACH'S CLOSED RANGE THEOREM
- Simplicial decomposition in nonlinear programming algorithms
- Rates of Convergence for Conditional Gradient Algorithms Near Singular and Nonsingular Extremals
- Generalized Conditional Gradient for Sparse Estimation
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- An extension of the frank and Wolfe method of feasible directions
- Inverse problems in spaces of measures
- An optimal transport approach for solving dynamic inverse problems in spaces of measures
- Linear convergence of accelerated conditional gradient algorithms in spaces of measures
- On the extremal points of the ball of the Benamou–Brenier energy
- A superposition principle for the inhomogeneous continuity equation with Hellinger–Kantorovich-regular coefficients
- Numerical analysis of sparse initial data identification for parabolic problems
- On Representer Theorems and Convex Regularization
- Sufficient Second-Order Conditions for Bang-Bang Control Problems
- Metric subregularity of the convex subdifferential in Banach spaces
- A Tight Upper Bound on the Rate of Convergence of Frank-Wolfe Algorithm
- The Alternating Descent Conditional Gradient Method for Sparse Inverse Problems
- Lectures on Choquet's theorem
- New analysis and results for the Frank-Wolfe method
- Linear convergence of Frank-Wolfe for rank-one matrix recovery without strong convexity
- A generalized conditional gradient method for dynamic inverse problems with optimal transport regularization
This page was built for publication: Asymptotic linear convergence of fully-corrective generalized conditional gradient methods
