Quadratic Support Functions in Quadratic Bilevel Problems
From MaRDI portal
Publication:4685742
DOI10.1007/978-3-319-89920-6_15zbMath1397.90292OpenAlexW2804271294MaRDI QIDQ4685742
No author found.
Publication date: 9 October 2018
Published in: Operations Research Proceedings (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-89920-6_15
Cites Work
- Unnamed Item
- Unnamed Item
- Solving quadratic convex bilevel programming problems using a smoothing method
- Computable numerical bounds for Lagrange multipliers of stationary points of nonconvex differentiable nonlinear programs
- On optimization properties of functions, with a concave minorant
- A global optimization method for solving convex quadratic bilevel programming problems
- Foundations of bilevel programming
- Solving convex quadratic bilevel programming problems using an enumeration sequential quadratic programming algorithm
- On computational search for optimistic solutions in bilevel problems
- Bilevel programming with convex lower level problems
- Filled functions for unconstrained global optimization.
This page was built for publication: Quadratic Support Functions in Quadratic Bilevel Problems