Cover Image

Extrapolated Hard Thresholding Algorithms with Finite Length for Composite $\ell_0$ Penalized Problems

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Wu, Fan, Wei, Jiazhen, Bian, Wei
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Smoothing Iterative Consensus-based Optimization Algorithm for Nonsmooth Nonconvex Optimization Problems with Global Optimality
by: Wei, Jiazhen, et al.
Published: (2025)

A Smoothing Consensus-Based Optimization Algorithm for Nonsmooth Nonconvex Optimization
by: Wei, Jiazhen, et al.
Published: (2025)

A consensus-based optimization method for nonsmooth nonconvex programs with approximated gradient descent scheme
by: Wei, Jiazhen, et al.
Published: (2025)

Proximal Iterative Hard Thresholding Algorithm for Sparse Group $\ell_0$-Regularized Optimization with Box Constraint
by: Ye, Yuge, et al.
Published: (2025)

A Generic Branch-and-Bound Algorithm for $\ell_0$-Penalized Problems with Supplementary Material
by: Elvira, Clément, et al.
Published: (2025)

Modified Block Newton Algorithm for $\ell_0$-Regularized Optimization
by: Ye, Yuge, et al.
Published: (2025)

Subspace Newton's Method for $\ell_0$-Regularized Optimization Problems with Box Constraint
by: Ye, Yuge, et al.
Published: (2025)

Zeroth-Order Hard-Thresholding: Gradient Error vs. Expansivity
by: de Vazelhes, William, et al.
Published: (2022)

Regularized Operator Extrapolation Method For Stochastic Bilevel Variational Inequality Problems
by: Khalafi, Mohammad, et al.
Published: (2025)

Probabilistic Iterative Hard Thresholding for Sparse Learning
by: Bergamaschi, Matteo, et al.
Published: (2024)

Sparse Recovery via $\ell_p^p/\ell_q^p$ Ratio Minimization: Theory and Algorithm
by: Yu, Lang, et al.
Published: (2026)

A Bregman Proximal Stochastic Gradient Method with Extrapolation for Nonconvex Nonsmooth Problems
by: Wang, Qingsong, et al.
Published: (2024)

New Outer Approximation Algorithms for Nonsmooth Convex MINLP Problems
by: Wei, Zhou, et al.
Published: (2026)

A New Branch-and-Bound Pruning Framework for $\ell_0$-Regularized Problems
by: Guyard, Theo, et al.
Published: (2024)

An Optimal Control Approach for Inverse Problems with Deep Learnable Regularizers
by: Bian, Wanyu
Published: (2024)

A smoothing Anderson acceleration algorithm for nonsmooth fixed point problem with linear convergence
by: Li, Zekai, et al.
Published: (2024)

Exact Penalization at D-Stationary Points of Cardinality- or Rank-Constrained Problem
by: Yagishita, Shotaro, et al.
Published: (2022)

Scalable Co-Design via Linear Design Problems: Compositional Theory and Algorithms
by: Cai, Yubo, et al.
Published: (2026)

Lower Complexity Bounds of First-order Methods for Affinely Constrained Composite Non-convex Problems
by: Liu, Wei, et al.
Published: (2025)

A Near-optimal Method for Linearly Constrained Composite Non-convex Non-smooth Problems
by: Liu, Wei, et al.
Published: (2025)

$\ell_0$ factor analysis
by: Wang, Linyang, et al.
Published: (2024)

A Fast and Convergent Algorithm for Unassigned Distance Geometry Problems
by: Fan, Jun, et al.
Published: (2025)

A Newton Interior-Point Method for $\ell_0$ Factor Analysis
by: Wang, Linyang, et al.
Published: (2025)

$\ell_0$ Factor Analysis: A P-Stationary Point Theory
by: Wang, Linyang, et al.
Published: (2024)

The Optimal Production Transport: Model and Algorithm
by: Fan, Jie, et al.
Published: (2024)

Proximity Operator of the $\ell_1$ over $\ell_2$ Function
by: Shen, Lixin, et al.
Published: (2026)

Sparse Recovery: The Square of $\ell_1/\ell_2$ Norms
by: Jia, Jianqing, et al.
Published: (2024)

Adaptive Extrapolated Proximal Gradient Methods with Variance Reduction for Composite Nonconvex Finite-Sum Minimization
by: Yuan, Ganzhao
Published: (2025)

Finite Termination of a Generalized Perceptron Algorithm
by: Bauschke, Heinz H., et al.
Published: (2026)

Robust principal component analysis with rank and cardinality regularization under matrix factorization
by: Li, Wenjing, et al.
Published: (2026)

Decomposition-Coordination Method for Finite Horizon Bandit Problems
by: de Lara, Michel, et al.
Published: (2021)

An Iteratively Reweighted Method for Sparse Optimization on Nonconvex $\ell_{p}$ Ball
by: Wang, Hao, et al.
Published: (2021)

Generalized Composed Alternating Relaxed Projection Algorithm for Two-Set Feasibility Problem
by: Li, Xinxin, et al.
Published: (2026)

De-singularity Subgradient for the $q$-th-Powered $\ell_p$-Norm Weber Location Problem
by: Lai, Zhao-Rong, et al.
Published: (2024)

A Branch and Bound Algorithm for Multiobjective Optimization Problems Using General Ordering Cones
by: Wu, Weitian, et al.
Published: (2024)

Steepest Descent Algorithm for M-convex Function Minimization Using Long Step Length
by: Oki, Taihei, et al.
Published: (2025)

A Linear Complexity Algorithm for Optimal Transport Problem with Log-type Cost
by: Lyu, Ziyuan, et al.
Published: (2025)

Projection-Free Algorithms for Minimax Problems
by: Giang-Tran, Khanh-Hung, et al.
Published: (2026)

Semismooth Newton Augmented Lagrangian Algorithm for Adaptive Lasso Penalized Least Squares in Semiparametric Regression
by: Li, Peili, et al.
Published: (2021)

The Error in Multivariate Linear Extrapolation with Applications to Derivative-Free Optimization
by: Cao, Liyuan, et al.
Published: (2023)