A constrained optimization reformulation and a feasible descent direction method for \(L_{1/2}\) regularization
From MaRDI portal
Publication:742307
DOI10.1007/s10589-014-9683-7zbMath1325.90089OpenAlexW2015399832MaRDI QIDQ742307
Publication date: 18 September 2014
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-014-9683-7
Related Items (3)
A Barzilai-Borwein-like iterative half thresholding algorithm for the \(L_{1/2}\) regularized problem ⋮ An interior stochastic gradient method for a class of non-Lipschitz optimization problems ⋮ Penalty and Augmented Lagrangian Methods for Constrained DC Programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Fast implementation of orthogonal greedy algorithm for tight wavelet frames
- Complexity of unconstrained \(L_2 - L_p\) minimization
- Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization
- An Unconstrained $\ell_q$ Minimization with $0q\leq1$ for Sparse Solution of Underdetermined Linear Systems
- Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization
- Smoothing Nonlinear Conjugate Gradient Method for Image Restoration Using Nonsmooth Nonconvex Minimization
- Restricted isometry properties and nonconvex compressive sensing
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Atomic Decomposition by Basis Pursuit
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- A new approach to variable selection in least squares problems
- Rate of Convergence of a Class of Methods of Feasible Directions
- On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
- A Tight Upper Bound on the Rate of Convergence of Frank-Wolfe Algorithm
- On the rate of convergence of certain methods of centers
- Analysis of the Recovery of Edges in Images and Signals by Minimizing Nonconvex Regularized Least-Squares
- Compressed sensing
This page was built for publication: A constrained optimization reformulation and a feasible descent direction method for \(L_{1/2}\) regularization
