An extrapolated iteratively reweighted \(\ell_1\) method with complexity analysis

DOI10.1007/s10589-022-00416-5zbMath1518.90109arXiv2101.03763OpenAlexW4302027578MaRDI QIDQ6043137

Hao Zeng, Hao Wang, Jiashan Wang

Publication date: 4 May 2023

Published in: Computational Optimization and Applications (Search for Journal in Brave)

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

zbMATH Keywords

extrapolation techniquesKurdyka-Łojasiewicziteratively reweighted methods\(\ell_p\) regularizationnon-Lipschitz regularization

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cites Work

• Unnamed Item
• Nearly unbiased variable selection under minimax concave penalty
• Primal-dual subgradient methods for convex problems
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
• Gradient methods for minimizing composite functions
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
• Approximation accuracy, gradient methods, and error bound for structured convex optimization
• Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming
• A note on the complexity of \(L _{p }\) minimization
• Enhancing sparsity by reweighted \(\ell _{1}\) minimization
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
• A proximal difference-of-convex algorithm with extrapolation
• Templates for convex cone problems with applications to sparse signal recovery
• Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems
• Kurdyka-Łojasiewicz exponent via inf-projection
• Relating \(\ell_p\) regularization and reweighted \(\ell_1\) regularization
• Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
• Iteratively reweighted \(\ell _1\) algorithms with extrapolation
• Portfolio optimization with linear and fixed transaction costs
• On Fej\'er monotone sequences and nonexpansive mappings
• A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
• An Unconstrained $\ell_q$ Minimization with $0q\leq1$ for Sparse Solution of Underdetermined Linear Systems
• On Single Image Scale-Up Using Sparse-Representations
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
• Sparse Regularization: Convergence Of Iterative Jumping Thresholding Algorithm
• The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
• Interior Gradient and Proximal Methods for Convex and Conic Optimization
• Mathematical Programs with Equilibrium Constraints

This page was built for publication: An extrapolated iteratively reweighted \(\ell_1\) method with complexity analysis