A linearly convergent algorithm for solving a class of nonconvex/affine feasibility problems

DOI10.1007/978-1-4419-9569-8_3MaRDI QIDQ2897274zbMATH OpenOpenAlexFDO

Authors Amir Beck, Marc Teboulle

Publication date 10 July 2012

Published in Springer Optimization and Its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-1-4419-9569-8_3

zbMATH Keywords

inverse problemscompressive sensinggradient projection algorithmsparse signal recoverylinear rate of convergenceaffine rank minimizationmutual coherence of a matrixnonconvex affine feasibilityscalable restricted isometry

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Recommendations

• Nonconvex notions of regularity and convergence of fundamental algorithms for feasibility problems
• A non-interior continuation algorithm for solving the convex feasibility problem
• On linear convergence of projected gradient method for a class of affine rank minimization problems
• A log-quadratic projection method for convex feasibility problems
• Non-Convex feasibility problems and proximal point methods

Cites work

• scientific article; zbMATH DE number 1818892 (Why is no real title available?)
• scientific article; zbMATH DE number 936298 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A generalized uncertainty principle and sparse representation in pairs of bases
• Atomic decomposition by basis pursuit
• Compressed sensing
• From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
• Gradient-based algorithms with applications to signal-recovery problems
• Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
• Iterative thresholding for sparse approximations
• Linear Inversion of Band-Limited Reflection Seismograms
• Method of successive projections for finding a common point of sets in metric spaces
• On Projection Algorithms for Solving Convex Feasibility Problems
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Signal enhancement-a composite property mapping algorithm
• Sparse Approximate Solutions to Linear Systems
• The restricted isometry property and its implications for compressed sensing
• Uncertainty principles and ideal atomic decomposition

Cited in

(11)

• Exact minimum rank approximation via Schatten p-norm minimization
• Prox-regularity of rank constraint sets and implications for algorithms
• Restricted normal cones and sparsity optimization with affine constraints
• Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems
• Randomized projection methods for convex feasibility: conditioning and convergence rates
• On linear convergence of projected gradient method for a class of affine rank minimization problems
• scientific article; zbMATH DE number 3965830 (Why is no real title available?)
• A linearized finite-difference method for the solution of some mixed concave and convex non-linear problems
• Matrix recipes for hard thresholding methods
• Global convergence and acceleration of projection methods for feasibility problems involving union convex sets
• On the complexity of solving feasibility problems with regularized models

This page was built for publication: A linearly convergent algorithm for solving a class of nonconvex/affine feasibility problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2897274)