Iterative reweighted minimization methods for l_p regularized unconstrained nonlinear programming
From MaRDI portal
(Redirected from Publication:463732)
Iterative reweighted minimization methods for \(l p\) regularized unconstrained nonlinear programming
Iterative reweighted minimization methods for \(l p\) regularized unconstrained nonlinear programming
Abstract: In this paper we study general regularized unconstrained minimization problems. In particular, we derive lower bounds for nonzero entries of first- and second-order stationary points, and hence also of local minimizers of the minimization problems. We extend some existing iterative reweighted (IRL1) and (IRL2) minimization methods to solve these problems and proposed new variants for them in which each subproblem has a closed form solution. Also, we provide a unified convergence analysis for these methods. In addition, we propose a novel Lipschitz continuous -approximation to . Using this result, we develop new IRL1 methods for the minimization problems and showed that any accumulation point of the sequence generated by these methods is a first-order stationary point, provided that the approximation parameter is below a computable threshold value. This is a remarkable result since all existing iterative reweighted minimization methods require that be dynamically updated and approach zero. Our computational results demonstrate that the new IRL1 method is generally more stable than the existing IRL1 methods [21,18] in terms of objective function value and CPU time.
Recommendations
- Iterative reweighted methods for \(\ell _1-\ell _p\) minimization
- A new spectral method for \(l_1\)-regularized minimization
- Convergence rate analysis of proximal iteratively reweighted \(\ell_1\) methods for \(\ell_p\) regularization problems
- A Globally Convergent Method for $l_p $ Problems
- On large-scale unconstrained optimization and arbitrary regularization
Cites work
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization
- An affine scaling methodology for best basis selection
- An interior-point method for large-scale \(l_1\)-regularized logistic regression
- An unconstrained \(\ell_q\) minimization with \(0<q\leq 1\) for sparse solution of underdetermined linear systems
- Atomic Decomposition by Basis Pursuit
- Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization
- Decoding by Linear Programming
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Fixed-Point Continuation Applied to Compressed Sensing: Implementation and Numerical Experiments
- Iterative hard thresholding for compressed sensing
- Iteratively reweighted least squares minimization for sparse recovery
- Lower bound theory of nonzero entries in solutions of \(\ell_2-\ell_p\) minimization
- Minimizing Nonconvex Functions for Sparse Vector Reconstruction
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Optimization and nonsmooth analysis
- Probing the Pareto frontier for basis pursuit solutions
- Recovery of sparsest signals via \(\ell^q \)-minimization
- Restricted isometry properties and nonconvex compressive sensing
- Reweighted \(\ell_1\)-minimization for sparse solutions to underdetermined linear systems
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Sparse Approximation via Penalty Decomposition Methods
- Sparse Reconstruction by Separable Approximation
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Two-Point Step Size Gradient Methods
Cited in
(72)- A new computational method for the sparsest solutions to systems of linear equations
- Nonconvex flexible sparsity regularization: theory and monotone numerical schemes
- A globally convergent algorithm for a class of gradient compounded non-Lipschitz models applied to non-additive noise removal
- A new globally convergent algorithm for non-Lipschitz \(\ell_{p}-\ell_q\) minimization
- Entropy function-based algorithms for solving a class of nonconvex minimization problems
- On optimal solutions of the constrained \({\ell}_{0}\) regularization and its penalty problem
- A fast and effective algorithm for sparse linear regression with \(\ell_p\)-norm data fidelity and elastic net regularization
- On monotone and primal-dual active set schemes for \(\ell^p\)-type problems, \(p \in (0,1]\)
- Isotropic non-Lipschitz regularization for sparse representations of random fields on the sphere
- Constrained optimization involving nonconvex \(\ell_p\) norms: optimality conditions, algorithm and convergence
- An extrapolated iteratively reweighted \(\ell_1\) method with complexity analysis
- A residual-based algorithm for solving a class of structured nonsmooth optimization problems
- A smoothing iterative method for quantile regression with nonconvex \(\ell_p\) penalty
- Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization
- Nonnegative iterative reweighted method for sparse linear complementarity problem
- Relating _p regularization and reweighted _1 regularization
- Lagrangian regularization approach to constrained optimization problems
- The nonconvex tensor robust principal component analysis approximation model via the weighted _p-norm regularization
- Robust amplitude method with \(L_{1/2}\)-regularization for compressive phase retrieval
- Accelerated sparse recovery via gradient descent with nonlinear conjugate gradient momentum
- Nonconvex sorted \(\ell_1\) minimization for sparse approximation
- The method IRLs for some best \(\ell_p\) norm solutions of under- or overdetermined linear systems
- An efficient non-convex total variation approach for image deblurring and denoising
- A Regularized Newton Method for \({\boldsymbol{\ell}}_{q}\) -Norm Composite Optimization Problems
- A Barzilai-Borwein-like iterative half thresholding algorithm for the \(L_{1/2}\) regularized problem
- Iterative reweighted methods for \(\ell _1-\ell _p\) minimization
- Penalty methods for a class of non-Lipschitz optimization problems
- Doubly iteratively reweighted algorithm for constrained compressed sensing models
- Nonlinear residual minimization by iteratively reweighted least squares
- A smoothing SQP framework for a class of composite L_q minimization over polyhedron
- Linearly constrained non-Lipschitz optimization for image restoration
- A constrained optimization reformulation and a feasible descent direction method for \(L_{1/2}\) regularization
- A Globally Convergent Method for $l_p $ Problems
- [[:Publication:6173530|Tensor Robust Principal Component Analysis via Tensor Fibered Rank and \({\boldsymbolTemplate:L p}\) Minimization]]
- A general framework of rotational sparse approximation in uncertainty quantification
- On constrained optimization with nonconvex regularization
- A unified primal dual active set algorithm for nonconvex sparse recovery
- Global optimality condition and fixed point continuation algorithm for non-Lipschitz _p regularized matrix minimization
- Iteratively reweighted \(\ell _1\) algorithms with extrapolation
- Approximation methods for a class of non-Lipschitz mathematical programs with equilibrium constraints
- Smoothing neural network for \(L_0\) regularized optimization problem with general convex constraints
- Capped \(\ell_p\) approximations for the composite \(\ell_0\) regularization problem
- A joint matrix minimization approach for multi-image face recognition
- Bayesian robust principal component analysis with structured sparse component
- A Laplacian approach to \(\ell_1\)-norm minimization
- 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
- An efficient optimization approach for a cardinality-constrained index tracking problem
- \(L_p\)-norm regularization algorithms for optimization over permutation matrices
- Optimality conditions for locally Lipschitz optimization with \(l_0\)-regularization
- An interior stochastic gradient method for a class of non-Lipschitz optimization problems
- Mathematical programs with complementarity constraints and a non-Lipschitz objective: optimality and approximation
- Iterative thresholding algorithm based on non-convex method for modified l_p-norm regularization minimization
- An outer-inner linearization method for non-convex and nondifferentiable composite regularization problems
- Iterative reweighted linear least squares for exact penalty subproblems on product sets
- Sparse minimax portfolio and Sharpe ratio models
- Nonconvex and nonsmooth sparse optimization via adaptively iterative reweighted methods
- Theory and application of \(p\)-regularized subproblems for \(p>2\)
- An improved algorithm for the \(L_2-L_p\) minimization problem
- Image retinex based on the nonconvex TV-type regularization
- Fast half-quadratic algorithm for image restoration and reconstruction
- A unified analysis of convex and non-convex \(\ell_p\)-ball projection problems
- Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization
- Sparse signal reconstruction via the approximations of \(\ell_0\) quasinorm
- Iteratively Linearized Reweighted Alternating Direction Method of Multipliers for a Class of Nonconvex Problems
- An iterative support shrinking algorithm for non-Lipschitz optimization in image restoration
- A general non-Lipschitz infimal convolution regularized model: Lower bound theory and algorithm
- A nonconvex ADMM for a class of sparse inverse semidefinite quadratic programming problems
- An accelerated majorization-minimization algorithm with convergence guarantee for non-Lipschitz wavelet synthesis model
- \(\ell _p\) regularized low-rank approximation via iterative reweighted singular value minimization
- Non-convex \(\ell_p\) regularization for sparse reconstruction of electrical impedance tomography
- An efficient semismooth Newton method for adaptive sparse signal recovery problems
This page was built for publication: Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q463732)
