Cover Image

Screening Cut Generation for Sparse Ridge Regression

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Tan, Haozhe, Wang, Guanyi
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

Solving Sparse \& High-Dimensional-Output Regression via Compression
by: Li, Renyuan, et al.
Published: (2024)

Sparse Principal Component Analysis with Non-Oblivious Adversarial Perturbations
by: He, Yuqing, et al.
Published: (2024)

Sparse Cuts for the Positive Semidefinite Cone
by: Günlük, Oktay, et al.
Published: (2026)

Sparse Convex Quantile Regression: A Generalized Benders Decomposition Approach
by: Luo, Xiaoyu, et al.
Published: (2025)

Generating Poisoning Attacks against Ridge Regression Models with Categorical Features
by: Guedes-Ayala, Monse, et al.
Published: (2025)

CLion: Efficient Cautious Lion Optimizer with Enhanced Generalization
by: Huang, Feihu, et al.
Published: (2026)

Sparse Polynomial Regression under Anomalous Data
by: Abolpour, Roozbeh, et al.
Published: (2025)

HomeAdam: Adam and AdamW Algorithms Sometimes Go Home to Obtain Better Provable Generalization
by: Huang, Feihu, et al.
Published: (2026)

Relax-and-Cut for Temporal SCUC Decomposition
by: Xiong, Jinxin, et al.
Published: (2025)

A Parallelized Cutting-Plane Algorithm for Computationally Efficient Modelling to Generate Alternatives
by: Lau, Michael, et al.
Published: (2025)

Normalization of ReLU Dual for Cut Generation in Stochastic Mixed-Integer Programs
by: Bansal, Akul, et al.
Published: (2026)

Generalization Bounds for Contextual Stochastic Optimization using Kernel Regression
by: Wang, Yijie, et al.
Published: (2024)

Deepest Cuts for Benders Decomposition
by: Hosseini, Mojtaba, et al.
Published: (2021)

Optimal Cross-Validation for Sparse Linear Regression
by: Cory-Wright, Ryan, et al.
Published: (2023)

Online Decision Making with Fairness over Time
by: Chen, Rui, et al.
Published: (2022)

Advanced Cutting-Plane Algorithms for ACOPF
by: Bienstock, Daniel, et al.
Published: (2025)

Learning Cuts via Enumeration Oracles
by: Thuerck, Daniel, et al.
Published: (2023)

Theoretical Challenges in Learning for Branch-and-Cut
by: Cheng, Hongyu, et al.
Published: (2026)

Fast Projection onto the Capped Simplex with Applications to Sparse Regression in Bioinformatics
by: Ang, Andersen, et al.
Published: (2021)

Tricks from the Trade for Large-Scale Markdown Pricing: Heuristic Cut Generation for Lagrangian Decomposition
by: Streeck, Robert, et al.
Published: (2024)

Learning Cut Generating Functions for Integer Programming
by: Cheng, Hongyu, et al.
Published: (2024)

Cutting Planes for Binarized Network Flow Problems
by: Bonami, Pierre, et al.
Published: (2025)

Accurate Linear Cutting-Plane Relaxations for ACOPF
by: Bienstock, Daniel, et al.
Published: (2023)

Parallelized Conflict Graph Cut Generation
by: Dai, Yongzheng, et al.
Published: (2023)

Rendezvous Planning from Sparse Observations of Optimally Controlled Targets
by: Scott, Thomas A., et al.
Published: (2026)

Cut-based Conflict Analysis in Mixed Integer Programming
by: Mexi, Gioni, et al.
Published: (2024)

ROS: A GNN-based Relax-Optimize-and-Sample Framework for Max-k-Cut Problems
by: Qiu, Yeqing, et al.
Published: (2024)

Transit-MP: Transit-Prioritized Max-Pressure Control in Sparse Connected Vehicle Environments
by: Tan, Chaopeng, et al.
Published: (2025)

Accelerating Regularized Attention Kernel Regression for Spectrum Cartography
by: Tao, Liping, et al.
Published: (2026)

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

Good and Fast Row-Sparse ah-Symmetric Reflexive Generalized Inverses
by: Ponte, Gabriel, et al.
Published: (2024)

A Linear and Scalable Cutting-Plane Algorithm for Electricity Pricing
by: Romero, Matías, et al.
Published: (2025)

Enforcing TSP-Optimality in Fair Vehicle Routing by Cutting Planes
by: van Rossum, Bart, et al.
Published: (2026)

On the ReLU Lagrangian Cuts for Stochastic Mixed Integer Programming
by: Deng, Haoyun, et al.
Published: (2024)

Accurate and Warm-Startable Linear Cutting-Plane Relaxations for ACOPF
by: Bienstock, Daniel, et al.
Published: (2024)

Data Clustering and Visualization with Recursive Max k-Cut Algorithm
by: Ly, An, et al.
Published: (2024)

From Generality to Specificity: Prior-Driven Optimal Sparse Transformation in Compressed Sensing
by: Zhu, Zhihan, et al.
Published: (2025)

Integer L-Shaped Method with Non-Supporting No-Good Optimality Cuts
by: Riley, Benjamin P., et al.
Published: (2025)

Parametric Disjunctive Cuts for Sequences of Mixed Integer Linear Optimization Problems
by: Kelley, Shannon, et al.
Published: (2025)

Applications of Lifted Nonlinear Cuts to Convex Relaxations of the AC Power Flow Equations
by: Bugosen, Sergio I., et al.
Published: (2024)