A computational study for bilevel quadratic programs using semidefinite relaxations
From MaRDI portal
Publication:323274
DOI10.1016/J.EJOR.2016.01.020zbMATH Open1346.90651OpenAlexW2276431609MaRDI QIDQ323274FDOQ323274
Authors: Pablo Adasme, Abdel Lisser 
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
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
semidefinite programmingbilevel programmingmixed integer linear programmingconic programming and interior point methods
Cites Work
- CSDP, A C library for semidefinite programming
- A Spectral Bundle Method for Semidefinite Programming
- An exact penalty on bilevel programs with linear vector optimization lower level
- Geometric algorithms and combinatorial optimization
- On the quasiconcave bilevel programming problem
- Foundations of bilevel programming
- Weak linear bilevel programming problems: existence of solutions via a penalty method
- A new approach for solving linear bilevel problems using genetic algorithms
- New Branch-and-Bound Rules for Linear Bilevel Programming
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- Links between linear bilevel and mixed 0-1 programming problems
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Variable neighborhood search
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
- New branch-and-Cut algorithm for bilevel linear programming
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Variable neighborhood search: Principles and applications
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Joint optimization of product family configuration and scaling design by Stackelberg game
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- Handbook on semidefinite, conic and polynomial optimization
- Variable neighborhood decomposition search
- Computational Difficulties of Bilevel Linear Programming
- Nonconvex Structures in Nonlinear Programming
- Stochastic and semidefinite optimization for scheduling in orthogonal frequency division multiple access networks
- Robust semidefinite relaxations for a quadratic OFDMA resource allocation scheme
- The computational complexity of multi-level linear programs
- Descent approaches for quadratic bilevel programming
- A semidefinite programming approach to the quadratic knapsack problem
- Algorithms for linear programming with linear complementarity constraints
- Disjunctive cuts for continuous linear bilevel programming
- Encyclopedia of optimization. In 6 vols.
- A computational study for bilevel quadratic programs using semidefinite relaxations
- Obtaining tighter relaxations of mathematical programs with complementarity constraints
- L’algebre de Boole et ses applications en recherche operationnelle
- Copositivity and constrained fractional quadratic problems
- The Linear-Quadratic 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 financial support provided by universitat de barcelona. the authors are very grateful to the referees for their valuable suggestions and comments
- 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
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
Uses Software
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)
