A computational study for bilevel quadratic programs using semidefinite relaxations
From MaRDI portal
Recommendations
- Bilevel polynomial programs and semidefinite relaxation methods
- Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems
- Semidefinite relaxation for linear programs with equilibrium constraints
- From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems
- Optimality conditions for special semidefinite bilevel optimization problems
Cites work
- A Spectral Bundle Method for Semidefinite Programming
- A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem
- A computational study for bilevel quadratic programs using semidefinite relaxations
- A new approach for solving linear bilevel problems using genetic algorithms
- A semidefinite programming approach to the quadratic knapsack problem
- Algorithms for linear programming with linear complementarity constraints
- An exact penalty on bilevel programs with linear vector optimization lower level
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- CSDP, A C library for semidefinite programming
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
- Computational Difficulties of Bilevel Linear Programming
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- Copositivity and constrained fractional quadratic problems
- Descent approaches for quadratic bilevel programming
- Disjunctive cuts for continuous linear bilevel programming
- Encyclopedia of optimization. In 6 vols.
- Foundations of bilevel programming
- Geometric algorithms and combinatorial optimization
- Handbook on semidefinite, conic and polynomial optimization
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Joint optimization of product family configuration and scaling design by Stackelberg game
- Links between linear bilevel and mixed 0-1 programming problems
- L’algebre de Boole et ses applications en recherche operationnelle
- New Branch-and-Bound Rules for Linear Bilevel Programming
- New branch-and-Cut algorithm for bilevel linear programming
- Nonconvex Structures in Nonlinear Programming
- Obtaining tighter relaxations of mathematical programs with complementarity constraints
- On the copositive representation of binary and continuous nonconvex quadratic programs
- On the quasiconcave bilevel programming problem
- 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 f
- Robust semidefinite relaxations for a quadratic OFDMA resource allocation scheme
- Stochastic and semidefinite optimization for scheduling in orthogonal frequency division multiple access networks
- The Linear-Quadratic Bilevel Programming Problem
- The computational complexity of multi-level linear programs
- Variable neighborhood decomposition search
- Variable neighborhood search
- Variable neighborhood search: Principles and applications
- Weak linear bilevel programming problems: existence of solutions via a penalty method
Cited in
(9)- On exact solution approaches for bilevel quadratic 0-1 knapsack problem
- A study of mixed discrete bilevel programs using semidefinite and semi-infinite programming
- Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems
- A computational study for bilevel quadratic programs using semidefinite relaxations
- Semidefinite relaxation for linear programs with equilibrium constraints
- Bilevel polynomial programs and semidefinite relaxation methods
- Bilevel optimization: theory, algorithms, applications and a bibliography
- Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
- From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems
This page was built for publication: A computational study for bilevel quadratic programs using semidefinite relaxations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q323274)
