arXiv (All)
open access
A true single-level reformulation for pessimistic bilevel optimization
We propose a single-level reformulation (SLR) for the pessimistic bilevel optimization problem that does not rely on complementarity conditions or optimal value functions. For this reason, we refer to it as a true single-level reformulation (tSLR). A remarkable consequence is that this reformulation
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
- Disciplined Bilevel Programming#820067
- Bi-ZOL: Bilevel Zeroth-Order Learning with Nonsmooth Responses#985422
- A Hybrid Subgradient Method for Nonsmooth Nonconvex Bilevel Optimization#160891
- Improved KKT Complexity for First-Order Bilevel Optimization under Weak Lower-Level Convexity#1144903
- Physics-Guided Bayesian Optimization for High-Dimensional Mixed-Variable MIMO Base Station Design#1160968
Record · ID 1142315
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