Cover Image

Average-case thresholds for exact regularization of linear programs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Friedlander, Michael P., Kubal, Sharvaj, Plan, Yaniv, Scott, Matthew S.
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control Numerical Analysis Probability 52A38, 60D05, 90C05, 90C31, 90C46
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Non-Substitution Theorem, Uniqueness of Solution and Convex combinations of basic optimal solutions for linear optimization
by: Lahiri, Somdeb
Published: (2024)

On Tail Decay and Moment Estimates of a Condition Number for Random Linear Conic Systems
by: Cheung, Dennis, et al.
Published: (2003)

Finding a second Hamiltonian decomposition of a 4-regular multigraph by integer linear programming
by: Nikolaev, Andrei V., et al.
Published: (2022)

The Geometry of Linear Program Compression: An Exact Characterization and Learning Algorithm
by: Ye, Yuhan, et al.
Published: (2026)

Stochastic dynamic programming with non-linear discounting
by: Bäuerle, Nicole, et al.
Published: (2020)

A new problem qualification based on approximate KKT conditions for Lipschitzian optimization with application to bilevel programming
by: Käming, Isabella, et al.
Published: (2024)

Multi-objective stochastic linear programming with recourse and flexible decision making
by: Hamel, Andreas H., et al.
Published: (2024)

Exact Solution Procedure for the Log-Linear Continuous Knapsack Problem
by: Lahiri, Somdeb
Published: (2024)

Linear models of dynamic optimization with linear constraints
by: Lahiri, Somdeb
Published: (2025)

On the geometry of circumcentric directions of cones
by: Bello-Cruz, Yunier
Published: (2026)

Boole's probability bounding problem, linear programming aggregations, and nonnegative quadratic pseudo-Boolean functions
by: Boros, Endre, et al.
Published: (2021)

Continuity in Parametric Linear Programming
by: Lahiri, Somdeb
Published: (2024)

A modified exact penalty approach for general constrained $\ell_0$-sparse optimization problems
by: Kanzow, Christian, et al.
Published: (2025)

On Solution Uniqueness and Robust Recovery for Sparse Regularization with a Gauge: from Dual Point of View
by: He, Jiahuan, et al.
Published: (2023)

Aubin Property and Strong Regularity Are Equivalent for Nonlinear Second-Order Cone Programming
by: Chen, Liang, et al.
Published: (2024)

Algebraic Farkas Lemma and Strong Duality for Perturbed Conic Linear Programming
by: Khanh, P. D., et al.
Published: (2026)

Non-Attainment of Minima in Non-Polyhedral Conic Optimization: A Robust SOCP Example
by: Nguyen, Vinh
Published: (2025)

Relaxations of KKT Conditions do not Strengthen Finite RLT and SDP-RLT Bounds for Nonconvex Quadratic Programs
by: Yildirim, E. Alper
Published: (2025)

Achieving $\tilde{\mathcal{O}}(1/N)$ Optimality Gap in Restless Bandits through Gaussian Approximation
by: Yan, Chen, et al.
Published: (2024)

On the Wasserstein alignment problem
by: Pal, Soumik, et al.
Published: (2025)

On solving a rank regularized minimization problem via equivalent factorized column-sparse regularized models
by: Li, Wenjing, et al.
Published: (2023)

On Circuit Imbalance and 0/1 Circuits for Coloring and Spanning Forest Problems
by: Borgwardt, Steffen, et al.
Published: (2025)

Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming
by: Löhne, Andreas, et al.
Published: (2015)

Learning Decision-Sufficient Representations for Linear Optimization
by: Ye, Yuhan, et al.
Published: (2026)

Convex Regularization and Convergence of Policy Gradient Flows under Safety Constraints
by: Malo, Pekka, et al.
Published: (2024)

A Deterministic and Linear Model of Dynamic Optimization
by: Lahiri, Somdeb
Published: (2025)

Cuts and semidefinite liftings for the complex cut polytope
by: Sinjorgo, Lennart, et al.
Published: (2024)

Lipschitz continuity of solution multifunctions of extended $\ell_1$ regularization problems
by: Meng, Kaiwen, et al.
Published: (2024)

Structural and Solution Analysis for the Ordered Weber Problem under Spatial Uncertainty
by: Blanco, Víctor, et al.
Published: (2025)

On the facet pivot simplex method for linear programming
by: Yang, Yaguang
Published: (2021)

Convergence Rates for $\ell_p$ Norm Minimization in Convex Vector Optimization
by: Alshahrani, Mohammed
Published: (2026)

A Near-Optimal Total Complexity for the Inexact Accelerated Proximal Gradient Method via Quadratic Growth
by: Li, Hongda, et al.
Published: (2026)

Multiple objective linear programming over the probability simplex
by: Mifrani, Anas
Published: (2024)

The vector linear program solver Bensolve -- notes on theoretical background
by: Löhne, Andreas, et al.
Published: (2015)

Anderson Accelerated Primal-Dual Hybrid Gradient for solving LP
by: Zhou, Yingxin, et al.
Published: (2025)

A double-pivot degenerate-robust simplex algorithm for linear programming
by: Yang, Yaguang, et al.
Published: (2021)

Qualitative and Generalized Differentiation Properties of Optimal Value Functions with Applications to Duality
by: Long, V. S. T., et al.
Published: (2025)

A Modified Proximal Bundle Method Under A Frank-Wolfe Perspective
by: Fersztand, David, et al.
Published: (2024)

Bounding-Focused Discretization Methods for the Global Optimization of Nonconvex Semi-Infinite Programs
by: Turan, Evren M., et al.
Published: (2023)

Lispchitz modulus of the argmin mapping in convex quadratic optimization
by: Cánovas, María Josefa, et al.
Published: (2025)