Geometric and computational hardness of bilevel programming

DOI10.1007/S10107-025-02229-WMaRDI QIDQ6873495zbMATH OpenFDO

Authors Jérôme Bolte, Edouard Pauwels, Samuel Vaiter

Publication date 16 January 2026

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Polynomial optimization (90C23)

This page was built for publication: Geometric and computational hardness of bilevel programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6873495)