Cover Image

Continuity in Parametric Linear Programming

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Lahiri, Somdeb
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control 90C05, 90C31
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

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

Faster Parametric Submodular Function Minimization by Exploiting Duality
by: Gupta, Swati, et al.
Published: (2026)

Low-Rank Multi-Objective Linear Programming
by: Löhne, Andreas, et al.
Published: (2025)

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

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

Strong Partitioning and a Machine Learning Approximation for Accelerating the Global Optimization of Nonconvex QCQPs
by: Kannan, Rohit, et al.
Published: (2022)

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

A Set-Valued Lagrange Theorem based on a Process for Convex Vector Programming
by: García-Castaño, Fernando, et al.
Published: (2024)

Lagrange Multipliers, Duality, and Sensitivity in Set-Valued Convex Programming via Pointed Closed Convex Processes
by: García-Castaño, Fernando, et al.
Published: (2024)

Two-Person Additively-Separable Sum Games
by: Lahiri, Somdeb
Published: (2025)

Linear Convergence and Error Bounds for Optimization Without Strong Convexity
by: van Treek, Kira, et al.
Published: (2025)

Linear programming for finite-horizon vector-valued Markov decision processes
by: Mifrani, Anas, et al.
Published: (2025)

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

Characterizations of the Aubin Property of the Solution Mapping for Nonlinear Semidefinite 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)

On the Relationships among GPU-Accelerated First-Order Methods for Solving Linear Programming
by: Chen, Kaihuang, et al.
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)

Fisher-Rao Gradient Flows of Linear Programs and State-Action Natural Policy Gradients
by: Müller, Johannes, et al.
Published: (2024)

Lipschitz upper semicontinuity of linear inequality systems under full perturbations
by: Camacho, Jesús, et al.
Published: (2025)

An Integer Linear Programming Model for the Evolomino Puzzle
by: Nikolaev, Andrei V., et al.
Published: (2026)

Average-case thresholds for exact regularization of linear programs
by: Friedlander, Michael P., et al.
Published: (2025)

Marginal minimization and sup-norm expansions in perturbed optimization
by: Spokoiny, Vladimir
Published: (2025)

A sensitivity-based method for bilevel optimization problems: Theoretical analysis and computational performance
by: Nolasco, Eduardo, et al.
Published: (2025)

Optimistic Bilevel Optimization with Composite Lower-Level Problem
by: Solla, Mattia, et al.
Published: (2026)

Globalized Adversarial Regret Optimization: Robust Decisions with Uncalibrated Predictions
by: Kurtz, Jannis, et al.
Published: (2026)

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

Linear Decision Tree Policies for Integer Linear Programs
by: Guyard, Théo, et al.
Published: (2026)

A Sparse Smoothing Newton Method for Solving Discrete Optimal Transport Problems
by: Hou, Di, et al.
Published: (2023)

A Corrected Inexact Proximal Augmented Lagrangian Method with a Relative Error Criterion for a Class of Group-quadratic Regularized Optimal Transport Problems
by: Yang, Lei, et al.
Published: (2023)

Existence of solutions for polyhedral convex set optimization problems
by: Löhne, Andreas
Published: (2023)

A solution method for arbitrary polyhedral convex set optimization problems
by: Löhne, Andreas
Published: (2023)

Peaceman-Rachford Splitting Method Converges Ergodically for Solving Convex Optimization Problems
by: Chen, Kaihuang, et al.
Published: (2025)

Duality of Hoffman constants
by: Pena, Javier F., et al.
Published: (2023)

A Linear Parameter-Varying Framework for the Analysis of Time-Varying Optimization Algorithms
by: Jakob, Fabian, et al.
Published: (2025)

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