Compressed Sensing With Nonlinear Observations and Related Nonlinear Optimization Problems
From MaRDI portal
Abstract: Non-convex constraints have recently proven a valuable tool in many optimisation problems. In particular sparsity constraints have had a significant impact on sampling theory, where they are used in Compressed Sensing and allow structured signals to be sampled far below the rate traditionally prescribed. Nearly all of the theory developed for Compressed Sensing signal recovery assumes that samples are taken using linear measurements. In this paper we instead address the Compressed Sensing recovery problem in a setting where the observations are non-linear. We show that, under conditions similar to those required in the linear setting, the Iterative Hard Thresholding algorithm can be used to accurately recover sparse or structured signals from few non-linear observations. Similar ideas can also be developed in a more general non-linear optimisation framework. In the second part of this paper we therefore present related result that show how this can be done under sparsity and union of subspaces constraints, whenever a generalisation of the Restricted Isometry Property traditionally imposed on the Compressed Sensing system holds.
Cited in
(53)- Restricted Robinson constraint qualification and optimality for cardinality-constrained cone programming
- Approximately normalized iterative hard thresholding for nonlinear compressive sensing
- Optimality conditions for locally Lipschitz optimization with l₀-regularization
- A non-convex regularization approach for compressive sensing
- FR-type algorithm for finding approximate solutions to nonlinear monotone operator equations
- Adaptive iterative hard thresholding for least absolute deviation problems with sparsity constraints
- \(l_1\)-norm based dynamic analysis of flexible multibody system modeled with trimmed isogeometry
- New hybrid three-term spectral-conjugate gradient method for finding solutions of nonlinear monotone operator equations with applications
- A data-driven line search rule for support recovery in high-dimensional data analysis
- Gradient projection Newton pursuit for sparsity constrained optimization
- Generalized greedy alternatives
- PRP-like algorithm for monotone operator equations
- A spin Glass model for reconstructing nonlinearly encrypted signals corrupted by noise
- Solving equations of random convex functions via anchored regression
- Greedy approximation in convex optimization
- Finding sparse solutions of systems of polynomial equations via group-sparsity optimization
- Optimality conditions for sparse nonlinear programming
- Nesterov's algorithm solving dual formulation for compressed sensing
- On solutions of sparsity constrained optimization
- The first-order necessary conditions for sparsity constrained optimization
- Majorization-minimization-based Levenberg-Marquardt method for constrained nonlinear least squares
- Morozov's discrepancy principle for _1-_2 sparsity regularization
- Linearized Bregman iterations for compressed sensing
- Fixed-Point Continuation Applied to Compressed Sensing: Implementation and Numerical Experiments
- Competitive optimization of compressed sensing
- scientific article; zbMATH DE number 6982922 (Why is no real title available?)
- Proximal mapping for symmetric penalty and sparsity
- Iterative hard thresholding methods for \(l_0\) regularized convex cone programming
- Global and quadratic convergence of Newton hard-thresholding pursuit
- Inverse problems on low-dimensional manifolds
- Nonlinear Iterative Hard Thresholding for Inverse Scattering
- Dual iterative hard thresholding
- The sparsest solutions to \(Z\)-tensor complementarity problems
- Solving inverse problems using data-driven models
- An inexact projected gradient method for sparsity-constrained quadratic measurements regression
- An efficient radiation analysis approach through compressive model for laser driven inertial confinement fusion
- An improved inertial projection method for solving convex constrained monotone nonlinear equations with applications
- Inversion of Band-Limited Discrete Fourier Transforms of Binary Images: Uniqueness and Algorithms
- Distributed primal outer approximation algorithm for sparse convex programming with separable structures
- A projected gradient method for nonlinear inverse problems with _1 - _2 sparsity regularization
- Continuous exact relaxation and alternating proximal gradient algorithm for partial sparse and partial group sparse optimization problems
- _1 - _2 sparsity regularization for nonlinear ill-posed problems
- Oracle-net for nonlinear compressed sensing in electrical impedance tomography reconstruction problems
- From theoretical guarantee to practical performance: selectable and optimal step-lengths for IHT and HTP algorithms in compressed sensing
- Nonlinear frames and sparse reconstructions in Banach spaces
- On the existence of a variational regularization parameter under Morozov's discrepancy principle for nonlinear inverse problems
- Sufficient condition based on nearly optimal order RIC for IHT algorithm
- A fast block nonlinear Bregman-Kaczmarz method with averaging for nonlinear sparse signal recovery
- Descending iterative hard thresholding: a robust approach to sparse recovery under heavy-tailed noise
- Derivative-free projection CG-based algorithm with restart strategy for solving convex-constrained nonlinear monotone equations and its application to logistic regression
- A subspace inertial method for derivative-free nonlinear monotone equations
- Second-order optimality conditions for sparse optimization via Fréchet second-order subdifferential
- Learning a Gaussian mixture for sparsity regularization in inverse problems
This page was built for publication: Compressed Sensing With Nonlinear Observations and Related Nonlinear Optimization Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989187)
