A note on the complexity of L _p minimization
From MaRDI portal
Publication:644905
Recommendations
- Complexity of unconstrained \(L_2 - L_p\) minimization
- Equivalence of minimal \(\ell _{0}\)- and \(\ell _{p }\)-norm solutions of linear equalities, inequalities and linear programs for sufficiently small \(p\)
- Iterative thresholding algorithm based on non-convex method for modified l_p-norm regularization minimization
- A gradient descent based algorithm for \(\ell_p\) minimization
- The sparsity of underdetermined linear system via \(l_p\) minimization for \(0 < p < 1\)
Cites work
- `` Strong NP-Completeness Results
- An Efficient Algorithm for Minimizing a Sum of p-Norms
- Decoding by Linear Programming
- Entropic regularization of the \(\ell _{0}\) function
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Greed is Good: Algorithmic Results for Sparse Approximation
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1131479 (Why is no real title available?)
- scientific article; zbMATH DE number 2079345 (Why is no real title available?)
- Iterative hard thresholding for compressed sensing
- Minimizing Nonconvex Functions for Sparse Vector Reconstruction
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- On \(\ell_ p\) programming
- On the complexity of approximating a KKT point of quadratic programming
- Polynomial time weak approximation algorithms for quadratic programming
- Sparse Approximate Solutions to Linear Systems
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Cited in
(78)- A joint matrix minimization approach for multi-image face recognition
- An improved algorithm for the \(L_2-L_p\) minimization problem
- Analysis of the equivalence relationship between \(l_{0}\)-minimization and \(l_{p}\)-minimization
- Univariate \(L^p\) and \(l^p\) averaging, \(0<p<1\), in polynomial time by utilization of statistical structure
- Spark-level sparsity and the _1 tail minimization
- On finding a generalized lowest rank solution to a linear semi-definite feasibility problem
- Linear program relaxation of sparse nonnegative recovery in compressive sensing microarrays
- Restricted \(p\)-isometry properties of partially sparse signal recovery
- Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems
- Tractable ADMM schemes for computing KKT points and local minimizers for \(\ell_0\)-minimization problems
- New regularization method and iteratively reweighted algorithm for sparse vector recovery
- Large deviations for stochastic fluid networks with Weibullian tails
- A solution approach for cardinality minimization problem based on fractional programming
- A nonconvex l₁ (l₁-l₂) model for image restoration with impulse noise
- A smoothing method for sparse optimization over convex sets
- Block-sparse recovery of semidefinite systems and generalized null space conditions
- The complexity results of the sparse optimization problems and reverse convex optimization problems
- Relating _p regularization and reweighted _1 regularization
- The nonnegative zero-norm minimization under generalized \(Z\)-matrix measurement
- A reweighted nuclear norm minimization algorithm for low rank matrix recovery
- A gradient descent based algorithm for \(\ell_p\) minimization
- On sparse beamformer design with reverberation
- Queue length asymptotics for the multiple-server queue with heavy-tailed Weibull service times
- An interior point method for \(L_{1 / 2}\)-SVM and application to feature selection in classification
- On the entropy of couplings
- Rank-one and sparse matrix decomposition for dynamic MRI
- Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization
- Note on time bounds of two-phase algorithms for \(L\)-convex function minimization
- Complexity of unconstrained \(L_2 - L_p\) minimization
- Nonconvex sorted \(\ell_1\) minimization for sparse approximation
- Entropy function-based algorithms for solving a class of nonconvex minimization problems
- Two pairs of families of polyhedral norms versus \(\ell _p\)-norms: proximity and applications in optimization
- Smoothing strategy along with conjugate gradient algorithm for signal reconstruction
- The equivalence of three types of error bounds for weakly and approximately convex functions
- Distributionally robust scheduling algorithms for total flow time minimization on parallel machines using norm regularizations
- Convergence rate analysis of proximal iteratively reweighted \(\ell_1\) methods for \(\ell_p\) regularization problems
- Sparse sensor placement optimization for classification
- L_p-norm regularization algorithms for optimization over permutation matrices
- Exact low-rank matrix recovery via nonconvex Schatten \(p\)-minimization
- Selected open problems in discrete geometry and optimization
- An \(L _{p }\) norm relaxation approach to positive influence maximization in social network under the deterministic linear threshold model
- An augmented Lagrangian method for non-Lipschitz nonconvex programming
- A smoothing SQP framework for a class of composite L_q minimization over polyhedron
- Sparse solutions of linear complementarity problems
- CVaR (superquantile) norm: stochastic case
- Distributed block coordinate descent for minimizing partially separable functions
- Complexity of penalized likelihood estimation
- Recent advances in mathematical programming with semi-continuous variables and cardinality constraint
- scientific article; zbMATH DE number 1557802 (Why is no real title available?)
- Sparse signal recovery via non-convex optimization and overcomplete dictionaries
- Accelerated methods for nonconvex optimization
- Least sparsity of \(p\)-norm based optimization problems with \(p>1\)
- Spherical designs and nonconvex minimization for recovery of sparse signals on the sphere
- Compressed sensing with coherent tight frames via \(l_q\)-minimization for \(0 < q \leq 1\)
- Minimal zero norm solutions of linear complementarity problems
- A note on the smoothing quadratic regularization method for non-Lipschitz optimization
- Selection and Fusion of Categorical Predictors with L0-Type Penalties
- Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties
- Sparse Solutions by a Quadratically Constrained ℓq (0 <q< 1) Minimization Model
- scientific article; zbMATH DE number 7626756 (Why is no real title available?)
- scientific article; zbMATH DE number 7626760 (Why is no real title available?)
- Non-convex \(\ell_p\) regularization for sparse reconstruction of electrical impedance tomography
- The Minimum Euclidean-Norm Point in a Convex Polytope: Wolfe's Combinatorial Algorithm is Exponential
- Difference-of-convex learning: directional stationarity, optimality, and sparsity
- Sparse solutions of a class of constrained optimization problems
- An extrapolated iteratively reweighted \(\ell_1\) method with complexity analysis
- Sparse approximation over the cube
- Equivalence of minimal \(\ell _{0}\)- and \(\ell _{p }\)-norm solutions of linear equalities, inequalities and linear programs for sufficiently small \(p\)
- Time-weighted nonnegative bridge index-tracking model and its application
- Cardinality minimization, constraints, and regularization: a survey
- Hessian barrier algorithms for non-convex conic optimization
- Restricted \(p\)-isometry property and its application for nonconvex compressive sensing
- Smoothing methods for nonsmooth, nonconvex minimization
- On the hardness of the L₁-L₂ regularization problem
- Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization
- Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach
- Local search methods for \(\ell_{1}\)-minimization in frame based signal compression
- A perturbation inequality for concave functions of singular values and its applications in low-rank matrix recovery
This page was built for publication: A note on the complexity of \(L _{p }\) minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q644905)
