Compressed Sensing With Nonlinear Observations and Related Nonlinear Optimization Problems
From MaRDI portal
Publication:2989187
DOI10.1109/TIT.2013.2245716zbMath1364.94111arXiv1205.1650OpenAlexW2106967375MaRDI QIDQ2989187
Publication date: 8 June 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1205.1650
Nonlinear programming (90C30) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Related Items (35)
Optimality conditions for sparse nonlinear programming ⋮ \(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 ⋮ Inverse problems on low-dimensional manifolds ⋮ 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 ⋮ Restricted Robinson constraint qualification and optimality for cardinality-constrained cone programming ⋮ 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 ⋮ Nonlinear Iterative Hard Thresholding for Inverse Scattering ⋮ Unnamed Item ⋮ 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 ⋮ Proximal Mapping for Symmetric Penalty and Sparsity ⋮ Majorization-minimization-based Levenberg-Marquardt method for constrained nonlinear least squares ⋮ Morozov's discrepancy principle for \(\alpha\ell_1-\beta\ell_2\) sparsity regularization ⋮ Iterative hard thresholding methods for \(l_0\) regularized convex cone programming ⋮ An Inexact Projected Gradient Method for Sparsity-Constrained Quadratic Measurements Regression ⋮ PRP-like algorithm for monotone operator equations ⋮ Nonlinear frames and sparse reconstructions in Banach spaces ⋮ The sparsest solutions to \(Z\)-tensor complementarity problems ⋮ Optimality conditions for locally Lipschitz optimization with \(l_0\)-regularization ⋮ Unnamed Item ⋮ Approximately normalized iterative hard thresholding for nonlinear compressive sensing ⋮ FR-type algorithm for finding approximate solutions to nonlinear monotone operator equations ⋮ Solving inverse problems using data-driven models ⋮ A spin Glass model for reconstructing nonlinearly encrypted signals corrupted by noise ⋮ Solving equations of random convex functions via anchored regression ⋮ Unnamed Item ⋮ Greedy approximation in convex optimization ⋮ Adaptive iterative hard thresholding for least absolute deviation problems with sparsity constraints ⋮ Finding sparse solutions of systems of polynomial equations via group-sparsity optimization ⋮ On solutions of sparsity constrained optimization ⋮ The first-order necessary conditions for sparsity constrained optimization
This page was built for publication: Compressed Sensing With Nonlinear Observations and Related Nonlinear Optimization Problems
