Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming

DOI10.1007/S10107-013-0722-4zbMath1308.90170arXiv1210.0066OpenAlexW2063761188MaRDI QIDQ463732

Zhaosong Lu

Publication date: 17 October 2014

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.0066

zbMATH Keywords

\(l_p\) minimizationiterative reweighted \(l_1\) minimizationiterative reweighted \(l_2\) minimization

Mathematics Subject Classification ID

Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Numerical methods based on nonlinear programming (49M37)

Related Items (59)

A smoothing iterative method for quantile regression with nonconvex \(\ell_p\) penalty ⋮ An efficient semismooth Newton method for adaptive sparse signal recovery problems ⋮ A General Non-Lipschitz Infimal Convolution Regularized Model: Lower Bound Theory and Algorithm ⋮ A Barzilai-Borwein-like iterative half thresholding algorithm for the \(L_{1/2}\) regularized problem ⋮ Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization ⋮ A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron ⋮ A General Framework of Rotational Sparse Approximation in Uncertainty Quantification ⋮ Linearly Constrained Non-Lipschitz Optimization for Image Restoration ⋮ Global optimality condition and fixed point continuation algorithm for non-Lipschitz \(\ell_p\) regularized matrix minimization ⋮ A joint matrix minimization approach for multi-image face recognition ⋮ An interior stochastic gradient method for a class of non-Lipschitz optimization problems ⋮ Bayesian robust principal component analysis with structured sparse component ⋮ Nonconvex flexible sparsity regularization: theory and monotone numerical schemes ⋮ Sparse minimax portfolio and Sharpe ratio models ⋮ An extrapolated iteratively reweighted \(\ell_1\) method with complexity analysis ⋮ Smoothing neural network for \(L_0\) regularized optimization problem with general convex constraints ⋮ Iteratively reweighted \(\ell _1\) algorithms with extrapolation ⋮ Sparse signal reconstruction via the approximations of \(\ell_0\) quasinorm ⋮ A unified analysis of convex and non-convex \(\ell_p\)-ball projection problems ⋮ Doubly iteratively reweighted algorithm for constrained compressed sensing models ⋮ Accelerated sparse recovery via gradient descent with nonlinear conjugate gradient momentum ⋮ A Regularized Newton Method for \({\boldsymbol{\ell}}_{q}\) -Norm Composite Optimization Problems ⋮ \(\ell _p\) regularized low-rank approximation via iterative reweighted singular value minimization ⋮ Tensor Robust Principal Component Analysis via Tensor Fibered Rank and \({\boldsymbol{{l_p}}}\) Minimization ⋮ Robust amplitude method with \(L_{1/2}\)-regularization for compressive phase retrieval ⋮ Convergence rate analysis of proximal iteratively reweighted \(\ell_1\) methods for \(\ell_p\) regularization problems ⋮ A Symmetric Alternating Direction Method of Multipliers for Separable Nonconvex Minimization Problems ⋮ On optimal solutions of the constrained ℓ ₀ regularization and its penalty problem ⋮ An iterative support shrinking algorithm for non-Lipschitz optimization in image restoration ⋮ Mathematical programs with complementarity constraints and a non-Lipschitz objective: optimality and approximation ⋮ A nonconvex ADMM for a class of sparse inverse semidefinite quadratic programming problems ⋮ On constrained optimization with nonconvex regularization ⋮ Relating \(\ell_p\) regularization and reweighted \(\ell_1\) regularization ⋮ On monotone and primal-dual active set schemes for \(\ell^p\)-type problems, \(p \in (0,1\)] ⋮ A globally convergent algorithm for a class of gradient compounded non-Lipschitz models applied to non-additive noise removal ⋮ Non-convex ℓ_p regularization for sparse reconstruction of electrical impedance tomography ⋮ An efficient non-convex total variation approach for image deblurring and denoising ⋮ Iterative reweighted methods for \(\ell _1-\ell _p\) minimization ⋮ Optimality conditions for locally Lipschitz optimization with \(l_0\)-regularization ⋮ A new globally convergent algorithm for non-Lipschitz \(\ell_{p}-\ell_q\) minimization ⋮ Penalty Methods for a Class of Non-Lipschitz Optimization Problems ⋮ Capped \(\ell_p\) approximations for the composite \(\ell_0\) regularization problem ⋮ A unified primal dual active set algorithm for nonconvex sparse recovery ⋮ A fast and effective algorithm for sparse linear regression with \(\ell_p\)-norm data fidelity and elastic net regularization ⋮ Nonnegative iterative reweighted method for sparse linear complementarity problem ⋮ Approximation methods for a class of non-Lipschitz mathematical programs with equilibrium constraints ⋮ Fast half-quadratic algorithm for image restoration and reconstruction ⋮ An outer-inner linearization method for non-convex and nondifferentiable composite regularization problems ⋮ A constrained optimization reformulation and a feasible descent direction method for \(L_{1/2}\) regularization ⋮ A residual-based algorithm for solving a class of structured nonsmooth optimization problems ⋮ An efficient optimization approach for a cardinality-constrained index tracking problem ⋮ Nonconvex and nonsmooth sparse optimization via adaptively iterative reweighted methods ⋮ The nonconvex tensor robust principal component analysis approximation model via the weighted \(\ell_p\)-norm regularization ⋮ Image retinex based on the nonconvex TV-type regularization ⋮ $L_p$-norm Regularization Algorithms for Optimization Over Permutation Matrices ⋮ A New Computational Method for the Sparsest Solutions to Systems of Linear Equations ⋮ Isotropic non-Lipschitz regularization for sparse representations of random fields on the sphere ⋮ An accelerated majorization-minimization algorithm with convergence guarantee for non-Lipschitz wavelet synthesis model ^* ⋮ Entropy function-based algorithms for solving a class of nonconvex minimization problems

Uses Software

• PDCO
• SPGL1

Cites Work

• Unnamed Item
• Unnamed Item
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Recovery of sparsest signals via \(\ell^q \)-minimization
• A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization
• Iterative hard thresholding for compressed sensing
• Enhancing sparsity by reweighted \(\ell _{1}\) minimization
• Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
• Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization
• An affine scaling methodology for best basis selection
• 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
• Fixed-Point Continuation Applied to Compressed Sensing: Implementation and Numerical Experiments
• Restricted isometry properties and nonconvex compressive sensing
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Decoding by Linear Programming
• Probing the Pareto Frontier for Basis Pursuit Solutions
• Iteratively reweighted least squares minimization for sparse recovery
• Optimization and nonsmooth analysis
• Two-Point Step Size Gradient Methods
• Atomic Decomposition by Basis Pursuit
• Nonmonotone Spectral Projected Gradient Methods on Convex Sets
• Sparse Reconstruction by Separable Approximation
• Minimizing Nonconvex Functions for Sparse Vector Reconstruction
• Reweighted $\ell_1$-Minimization for Sparse Solutions to Underdetermined Linear Systems
• Sparse Approximation via Penalty Decomposition Methods

This page was built for publication: Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming