Cover Image

A Generic Branch-and-Bound Algorithm for $\ell_0$-Penalized Problems with Supplementary Material

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Elvira, Clément, Guyard, Théo, Herzet, Cédric
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

El0ps: An Exact L0-regularized Problems Solver
by: Guyard, Théo, et al.
Published: (2025)

One to beat them all: "RYU" -- a unifying framework for the construction of safe balls
by: Tran, Thu-Le, et al.
Published: (2023)

PACE: Prune-And-Compress Ensemble Models
by: Akkerman, Fabian, et al.
Published: (2026)

Supplementary Materials to Graph Convolutional Branch and Bound
by: Sciandra, Lorenzo, et al.
Published: (2024)

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

An Efficient Spatial Branch-and-Bound Algorithm for Global Optimization of Gaussian Process Posterior Mean Functions
by: Tang, Wei-Ting, et al.
Published: (2026)

A Rolling-Space Branch-and-Price Algorithm for the Multi-Compartment Vehicle Routing Problem with Multiple Time Windows
by: Raqabi, El Mehdi Er, et al.
Published: (2026)

Extrapolated Hard Thresholding Algorithms with Finite Length for Composite $\ell_0$ Penalized Problems
by: Wu, Fan, et al.
Published: (2025)

Non-linear Multi-objective Optimization with Probabilistic Branch and Bound
by: Huang, Hao, et al.
Published: (2025)

AdaSwitch: An Adaptive Switching Meta-Algorithm for Learning-Augmented Bounded-Influence Problems
by: Chen, Xi, et al.
Published: (2025)

A Semidefinite Programming-Based Branch-and-Cut Algorithm for Biclustering
by: Sudoso, Antonio M.
Published: (2024)

A Stochastic-Gradient-based Interior-Point Algorithm for Solving Smooth Bound-Constrained Optimization Problems
by: Curtis, Frank E., et al.
Published: (2023)

Disjunctive Branch-and-Bound for Certifiably Optimal Low-Rank Matrix Completion
by: Bertsimas, Dimitris, et al.
Published: (2023)

Machine Learning Augmented Branch and Bound for Mixed Integer Linear Programming
by: Scavuzzo, Lara, et al.
Published: (2024)

Towards An Efficient Approach for the Nonconvex $\ell_p$ Ball Projection: Algorithm and Analysis
by: Yang, Xiangyu, et al.
Published: (2021)

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

From Sequential Nodes to GPU Batches: Parallel Branch and Bound for Optimal $k$-Sparse GLMs
by: Liu, Jiachang, et al.
Published: (2026)

Optimal Algorithms for Stochastic Complementary Composite Minimization
by: d'Aspremont, Alexandre, et al.
Published: (2022)

Dynamic Range Reduction via Branch-and-Bound
by: Gerlach, Thore, et al.
Published: (2024)

Derivative-free Alternating Projection Algorithms for General Nonconvex-Concave Minimax Problems
by: Xu, Zi, et al.
Published: (2021)

Sample Complexity of Algorithm Selection Using Neural Networks and Its Applications to Branch-and-Cut
by: Cheng, Hongyu, et al.
Published: (2024)

Mirror and Preconditioned Gradient Descent in Wasserstein Space
by: Bonet, Clément, et al.
Published: (2024)

Generalization Guarantees for Learning Branch-and-Cut Policies in Integer Programming
by: Cheng, Hongyu, et al.
Published: (2025)

An Asynchronous Decentralised Optimisation Algorithm for Nonconvex Problems
by: Mafakheri, Behnam, et al.
Published: (2025)

Fast Algorithm for Constrained Linear Inverse Problems
by: Sheriff, Mohammed Rayyan, et al.
Published: (2022)

CORL: Reinforcement Learning of MILP Policies Solved via Branch and Bound
by: Anand, Akhil S, et al.
Published: (2025)

A Lower Bound and a Near-Optimal Algorithm for Bilevel Empirical Risk Minimization
by: Dagréou, Mathieu, et al.
Published: (2023)

Regret Bounds for Expected Improvement Algorithms in Gaussian Process Bandit Optimization
by: Tran-The, Hung, et al.
Published: (2022)

A Support-Set Algorithm for Optimization Problems with Nonnegative and Orthogonal Constraints
by: Wang, Lei, et al.
Published: (2025)

Untangling Lariats: Subgradient Following of Variationally Penalized Objectives
by: Mo, Kai-Chia, et al.
Published: (2024)

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

Computation of Least Trimmed Squares: A Branch-and-Bound framework with Hyperplane Arrangement Enhancements
by: Meng, Xiang, et al.
Published: (2026)

Sparse Deep Learning Models with the $\ell_1$ Regularization
by: Shen, Lixin, et al.
Published: (2024)

Linearly Convergent Algorithms for Nonsmooth Problems with Unknown Smooth Pieces
by: Zhang, Zhe, et al.
Published: (2025)

Functionally Constrained Algorithm Solves Convex Simple Bilevel Problems
by: Zhang, Huaqing, et al.
Published: (2024)

A Double Inertial Forward-Backward Splitting Algorithm With Applications to Regression and Classification Problems
by: Işik, İrfan, et al.
Published: (2025)

Tight Generalization Bounds for Noiseless Inverse Optimization
by: Fatemi, Pouria, et al.
Published: (2026)

Randomized Block-Coordinate Optimistic Gradient Algorithms for Root-Finding Problems
by: Tran-Dinh, Quoc, et al.
Published: (2023)

Mirror Descent-Type Algorithms for the Variational Inequality Problem with Functional Constraints
by: Alkousa, Mohammad S., et al.
Published: (2026)