Using neural networks to solve linear bilevel problems with unknown lower level
From MaRDI portal
Publication:6097481
DOI10.1007/s11590-022-01958-7zbMath1519.90229OpenAlexW4321094360MaRDI QIDQ6097481
Publication date: 5 June 2023
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-022-01958-7
Cites Work
- Unnamed Item
- Characterizing an optimal solution to the linear bilevel programming problem
- Foundations of bilevel programming
- The cost of not knowing enough: mixed-integer optimization with implicit Lipschitz nonlinearities
- Complexity of near-optimal robust versions of multilevel optimization problems
- A decomposition method for MINLPs with Lipschitz continuous nonlinearities
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- Optimality conditions for the bilevel programming problem
- A Note on: An Efficient Point Algorithm for a Linear Two-Stage Optimization Problem
- A note on the optimality conditions for the bilevel programming problem
- New Branch-and-Bound Rules for Linear Bilevel Programming
- A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem
- A Unified Framework for Multistage Mixed Integer Linear Optimization
- Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
- Safety Verification and Robustness Analysis of Neural Networks via Quadratic Constraints and Semidefinite Programming
- Two-Level Linear Programming
- The Mixed Integer Linear Bilevel Programming Problem
- A survey on mixed-integer programming techniques in bilevel optimization
This page was built for publication: Using neural networks to solve linear bilevel problems with unknown lower level