Developing solution methods for discrete bilevel problems is known to be a challenging task— even if all parameters of the problem are exactly known. Many real-world applications of …
We address the problem of finding a local solution to a nonconvex–nonconcave minmax optimization using Newton type methods, including primal-dual interior-point ones. The first …
E Fernandez, I Ljubic, N Zerega - arXiv preprint arXiv:2406.02439, 2024 - arxiv.org
We address a new prize-collecting problem of routing commodities in a given network with hub and non-hub nodes, in which the service of the non-hub nodes will be outsourced to …
Robust and bilevel optimization share the common feature that they involve a certain multilevel structure. Hence, although they model something rather different when used in …
Y Beck, I Ljubić, M Schmidt - 2024 - optimization-online.org
Due to their nested structure, bilevel problems are intrinsically hard to solve—even if all variables are continuous and all parameters of the problem are exactly known. In this paper …
Y Beck, I Ljubi, M Schmidt - Book of abstracts PGMO DAYS …, 2023 - fondation-hadamard.fr
Due to their nested structure, bilevel problems are intrinsically hard to solve even if all variables are continuous and all parameters of the problem are exactly known. In this paper …