Imagen de Portada

Screening Cut Generation for Sparse Ridge Regression

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Tan, Haozhe, Wang, Guanyi
Formato:	Preprint
Publicado:	2025
Materias:	Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

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

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

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

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

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

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

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

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

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

Deepest Cuts for Benders Decomposition
por: Hosseini, Mojtaba, et al.
Publicado: (2021)

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

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

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

Learning Cuts via Enumeration Oracles
por: Thuerck, Daniel, et al.
Publicado: (2023)

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

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

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

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

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

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

Parallelized Conflict Graph Cut Generation
por: Dai, Yongzheng, et al.
Publicado: (2023)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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