Distances on Finite Constraint Systems and LICQ Radii in Nonlinear Programming
Abstract
Mathematical programming formulations are routinely modified through algebraic reformulations, perturbations of constraint functions, and the addition or removal of constraints. Some of these modifications preserve the feasible set, whereas others reflect newly imposed modeling requirements and therefore change the optimization problem itself. This paper develops a metric framework for quantifying the robustness of formulation-dependent properties. Formulations are modeled as typed collections of constraint functions. Within each fixed typed-cardinality class, their distance is defined by optimally matching constraints of the same type and measuring the resulting discrepancies in a norm on the underlying function space. As a concrete demonstration of the framework, we study the Linear Independence Constraint Qualification (LICQ). We introduce the pointwise LICQ radius, defined as the distance from a feasible formulation to the set of formulations that remain feasible at a prescribed point but fail LICQ there. Under suitable assumptions, we derive an explicit formula for this radius and characterize the effect of adding a single equality or inequality constraint.
Related
- Constraint Qualifications and Regularity Conditions for Nonlinear Constraint Systems
- RUPA: Nonlinear volume consistency, constraint geometry and singular penalty limits in finite elements
- Admissibility-Preserving Constraint Lifting for Conditional Deadbeat Control of Discrete-Time Nonlinear Systems
- A complete classification of the existence of finite-dimensional quantum solutions to inconsistent linear constraint systems
- Finite Sample Identification of Analytic Nonlinear Systems
BibTeX
@misc{hatano2026distances,
title = {{Distances on Finite Constraint Systems and LICQ Radii in Nonlinear Programming}},
author = {Kohei Hatano},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.09991},
eprint = {2610.09991},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.09991},
}
RIS
TY - UNPB
TI - Distances on Finite Constraint Systems and LICQ Radii in Nonlinear Programming
AU - Kohei Hatano
PY - 2026
DA - 2026/10/07
PB - arXiv
DO - 10.48550/arxiv.2610.09991
UR - https://arxiv.org/abs/2610.09991
AB - Mathematical programming formulations are routinely modified through algebraic reformulations, perturbations of constraint functions, and the addition or removal of constraints. Some of these modifications preserve the feasible set, whereas others reflect newly imposed modeling requirements and therefore change the optimization problem itself. This paper develops a metric framework for quantifying the robustness of formulation-dependent properties. Formulations are modeled as typed collections of constraint functions. Within each fixed typed-cardinality class, their distance is defined by optimally matching constraints of the same type and measuring the resulting discrepancies in a norm on the underlying function space. As a concrete demonstration of the framework, we study the Linear Independence Constraint Qualification (LICQ). We introduce the pointwise LICQ radius, defined as the distance from a feasible formulation to the set of formulations that remain feasible at a prescribed point but fail LICQ there. Under suitable assumptions, we derive an explicit formula for this radius and characterize the effect of adding a single equality or inequality constraint.
ER -