arXiv (All)
open access
Distances on Finite Constraint Systems and LICQ Radii in Nonlinear Programming
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 ther
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On coupling constraints in linear bilevel optimization#796343
- Code distances of matrix rank-metric codes under Add-and-Remove transformations#1188138
- Quadratic Characterizations for Reachability Analysis of Neural Networks#1297138
- Solving Quasi-Variational Inequalities Using the Progressive Decoupling of Linkages#780992
- Solving Quasi-Variational Inequalities Using the Progressive Decoupling of Linkages#779617
Record · ID 1234358
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive