A computational study for bilevel quadratic programs using semidefinite relaxations
From MaRDI portal
Publication:323274
DOI10.1016/j.ejor.2016.01.020zbMath1346.90651OpenAlexW2276431609MaRDI QIDQ323274
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.01.020
semidefinite programmingmixed integer linear programmingbilevel programmingconic programming and interior point methods
Related Items (3)
On exact solution approaches for bilevel quadratic 0-1 knapsack problem ⋮ A computational study for bilevel quadratic programs using semidefinite relaxations ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
Uses Software
Cites Work
- Unnamed Item
- A computational study for bilevel quadratic programs using semidefinite relaxations
- Copositivity and constrained fractional quadratic problems
- Stochastic and semidefinite optimization for scheduling in orthogonal frequency division multiple access networks
- Robust semidefinite relaxations for a quadratic OFDMA resource allocation scheme
- Handbook on semidefinite, conic and polynomial optimization
- A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- An exact penalty on bilevel programs with linear vector optimization lower level
- The computational complexity of multi-level linear programs
- Geometric algorithms and combinatorial optimization
- On the quasiconcave bilevel programming problem
- Descent approaches for quadratic bilevel programming
- Variable neighborhood search
- Links between linear bilevel and mixed 0-1 programming problems
- A semidefinite programming approach to the quadratic knapsack problem
- Foundations of bilevel programming
- Weak linear bilevel programming problems: existence of solutions via a penalty method
- Variable neighborhood decomposition search
- Algorithms for linear programming with linear complementarity constraints
- Joint optimization of product family configuration and scaling design by Stackelberg game
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Disjunctive cuts for continuous linear bilevel programming
- A new approach for solving linear bilevel problems using genetic algorithms
- New branch-and-Cut algorithm for bilevel linear programming
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints
- Computational Difficulties of Bilevel Linear Programming
- Nonconvex Structures in Nonlinear Programming
- L’algebre de Boole et ses applications en recherche operationnelle
- Cones of Matrices and Set-Functions and 0–1 Optimization
- New Branch-and-Bound Rules for Linear Bilevel Programming
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- The Linear-Quadratic Bilevel Programming Problem
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- CSDP, A C library for semidefinite programming
- A Spectral Bundle Method for Semidefinite Programming
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- Optimality conditions and an algorithm for linear-quadratic bilevel programs$fr1:1$f:1partially supported by nsfc and madis. this paper was prepared during the first author's visiting universitat de barcelona. he is grateful to the financial support provided by universitat de barcelona. the authors are very grateful to the referees for their valuable suggestions and comments
- Variable neighborhood search: Principles and applications
This page was built for publication: A computational study for bilevel quadratic programs using semidefinite relaxations
