arXiv (All)
open access
Exact penalty functions in optimization with unbounded constraint sets
This paper identifies necessary and sufficient conditions for the exactness of penalty functions in optimization problems whose constraint sets are not necessarily bounded. The case where the data of problems are {\em locally Lipschitz or semi-algebraic} is studied in detail. The conditions are give
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
- Boundedness and Separation Between Induced and Non-Induced Covering Numbers#996688
- A Bounded Degree SOS Plus SONC Hierarchy for Polynomial Optimization#1061859
- Extended Formulations in Mixed-Integer Convex Programming#364420
- Semi-differentiability of generalised $L^\infty$ envelopes with applications to supremal functionals#1064462
- An exact duality theory for semidefinite programming and its complexity implications#445455
Record · ID 1354083
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