The alternating descent conditional gradient method for sparse inverse problems
From MaRDI portal
compressed sensingconditional gradient methodconvex optimizationinverse problemsmeasuressemi-infinite programmingsparsity
Numerical methods based on nonlinear programming (49M37) Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Semi-infinite programming (90C34) Extreme-point and pivoting methods (90C49) Methods of reduced gradient type (90C52) Applications of mathematical programming (90C90)
Abstract: We propose a variant of the classical conditional gradient method for sparse inverse problems with differentiable measurement models. Such models arise in many practical problems including superresolution, time-series modeling, and matrix completion. Our algorithm combines nonconvex and convex optimization techniques: we propose global conditional gradient steps alternating with nonconvex local search exploiting the differentiable measurement model. This hybridization gives the theoretical global optimality guarantees and stopping conditions of convex optimization along with the performance and modeling flexibility associated with nonconvex optimization. Our experiments demonstrate that our technique achieves state-of-the-art results in several applications.
Recommendations
- Generalized conditional gradient for sparse estimation
- Sparse inverse problems over measures: equivalence of the conditional gradient and exchange methods
- Accelerated sparse recovery via gradient descent with nonlinear conjugate gradient momentum
- Inverse problems with nonnegative and sparse solutions: algorithms and application to the phase retrieval problem
- A generalized conditional gradient method for nonlinear operator equations with sparsity constraints
Cites work
- A general framework for fast stagewise algorithms
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- A sparse signal reconstruction perspective for source localization with sensor arrays
- Compressed remote sensing of sparse objects
- Compressed Sensing Off the Grid
- Conditional gradient algorithms for norm-regularized smooth convex optimization
- Conditional gradient algorithms with open loop step size rules
- Convex Analysis
- Exact matrix completion via convex optimization
- Forward–Backward Greedy Algorithms for Atomic Norm Regularization
- High-Resolution Radar via Compressed Sensing
- scientific article; zbMATH DE number 6381735 (Why is no real title available?)
- scientific article; zbMATH DE number 1324223 (Why is no real title available?)
- scientific article; zbMATH DE number 3235594 (Why is no real title available?)
- scientific article; zbMATH DE number 3345848 (Why is no real title available?)
- Inverse problems in spaces of measures
- Learning sparsely used overcomplete dictionaries via alternating minimization
- Low-rank matrix completion using alternating minimization
- Optimal Design of Experiments
- Parallel stochastic gradient algorithms for large-scale matrix completion
- Probabilistic graphical models.
- Random sampling of sparse trigonometric polynomials
- Recovery of Sparse Translation-Invariant Signals With Continuous Basis Pursuit
- Semi-infinite programming, duality, discretization and optimality conditions†
- Semi-Infinite Programming: Theory, Methods, and Applications
- Sparse Optimization with Least-Squares Constraints
- Spectral compressive sensing
- Techniques for exploring the suboptimal set
- The convex geometry of linear inverse problems
- The effectiveness of Lloyd-type methods for the \(k\)-means problem
- Towards a Mathematical Theory of Super‐resolution
Cited in
(57)- Conditional gradient method for multiobjective optimization
- Super-resolution of positive sources on an arbitrarily fine grid
- Super-resolution for doubly-dispersive channel estimation
- Sparsest piecewise-linear regression of one-dimensional data
- TV-based spline reconstruction with Fourier measurements: uniqueness and convergence of grid-based methods
- Degrees of freedom for off-the-grid sparse estimation
- Sparse optimization on measures with over-parameterized gradient descent
- Nonconvex regularization for sparse neural networks
- On the linear convergence rates of exchange and continuous methods for total variation minimization
- Super-resolution by means of Beurling minimal extrapolation
- Multi-kernel unmixing and super-resolution using the modified matrix pencil method
- A sparse control approach to optimal sensor placement in PDE-constrained parameter estimation problems
- Generalized notions of sparsity and restricted isometry property. II: Applications
- Stable super-resolution limit and smallest singular value of restricted Fourier matrices
- The geometry of off-the-grid compressed sensing
- Relaxing Alternating Direction Method of Multipliers (ADMM) for Linear Inverse Problems
- Saturating splines and feature selection
- Generalized conditional gradient for sparse estimation
- MultiDimensional Sparse Super-Resolution
- Linear convergence of accelerated conditional gradient algorithms in spaces of measures
- On the extremal points of the ball of the Benamou-Brenier energy
- An Epigraphical Approach to the Representer Theorem
- On the Frank-Wolfe algorithm for non-compact constrained optimization problems
- On the uniqueness of solutions for the basis pursuit in the continuum
- A stochastic gradient descent approach with partitioned-truncated singular value decomposition for large-scale inverse problems of magnetic modulus data
- Stochastic gradient descent for linear inverse problems in Hilbert spaces
- An off-the-grid approach to multi-compartment magnetic resonance fingerprinting
- Dynamic spike superresolution and applications to ultrafast ultrasound imaging
- A fast homotopy algorithm for gridless sparse recovery
- The sliding Frank-Wolfe algorithm and its application to super-resolution microscopy
- Sparse inverse problems over measures: equivalence of the conditional gradient and exchange methods
- A Convex Approach to Superresolution and Regularization of Lines in Images
- Safe Rules for the Identification of Zeros in the Solutions of the SLOPE Problem
- ``FISTA in Banach spaces with adaptive discretisations
- A generalized conditional gradient method for dynamic inverse problems with optimal transport regularization
- Convergence rates of gradient methods for convex optimization in the space of measures
- Short paper -- A note on the Frank-Wolfe algorithm for a class of nonconvex and nonsmooth optimization problems
- Dynamical programming for off-the-grid dynamic inverse problems
- Dimension reduction, exact recovery, and error estimates for sparse reconstruction in phase space
- Asymptotic linear convergence of fully-corrective generalized conditional gradient methods
- Towards off-the-grid algorithms for total variation regularized inverse problems
- Inexact and stochastic generalized conditional gradient with augmented Lagrangian and proximal step
- Localization of point scatterers via sparse optimization on measures
- Simultaneous off-the-grid learning of mixtures issued from a continuous dictionary
- Multi-scale CLEAN for Fourier-based hard x-ray solar imaging
- Super-resolved Lasso
- Hearing the shape of a cuboid room using sparse measure recovery
- Controlled learning of pointwise nonlinearities in neural-network-like architectures
- Convergence analysis of the discretization of continuous-domain inverse problems
- A -convergence result and an off-the-grid charge algorithm for curve reconstruction in inverse problems
- Extremal points and sparse optimization for generalized Kantorovich-Rubinstein norms
- A sparse optimization approach to infinite infimal convolution regularization
- Mean field optimization problems: stability results and Lagrangian discretization
- Effective regions and kernels in continuous sparse regularization, with application to sketched mixtures
- Accelerated projected gradient method for linear inverse problems with sparsity constraints
- Inverse point source location with the Helmholtz equation on a bounded domain
- Towards off-the-grid algorithms for total variation regularized inverse problems
This page was built for publication: The alternating descent conditional gradient method for sparse inverse problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5737722)
