A computational study for bilevel quadratic programs using semidefinite relaxations (Q323274): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(3 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2016.01.020 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Weak linear bilevel programming problems: existence of solutions via a penalty method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic and semidefinite optimization for scheduling in orthogonal frequency division multiple access networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational study for bilevel quadratic programs using semidefinite relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust semidefinite relaxations for a quadratic OFDMA resource allocation scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Copositivity and constrained fractional quadratic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook on semidefinite, conic and polynomial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact penalty on bilevel programs with linear vector optimization lower level / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive cuts for continuous linear bilevel programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Links between linear bilevel and mixed 0-1 programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New branch-and-Cut algorithm for bilevel linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Difficulties of Bilevel Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of multi-level linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: CSDP, A C library for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the copositive representation of binary and continuous nonconvex quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the quasiconcave bilevel programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach for solving linear bilevel problems using genetic algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of bilevel programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2724100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: L’algebre de Boole et ses applications en recherche operationnelle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Joint optimization of product family configuration and scaling design by Stackelberg game / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Linear Integer Programming Formulations of Nonlinear Integer Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Branch-and-Bound Rules for Linear Bilevel Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search: Principles and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood decomposition search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Spectral Bundle Method for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A semidefinite programming approach to the quadratic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Linear-Quadratic Bilevel Programming Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for linear programming with linear complementarity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cones of Matrices and Set-Functions and 0–1 Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonconvex Structures in Nonlinear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descent approaches for quadratic bilevel programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality conditions and an algorithm for linear-quadratic bilevel programs$fr1:<sup>1</sup>$f:<sup>1</sup>partially 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 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2016.01.020 / rank
 
Normal rank

Latest revision as of 14:24, 9 December 2024

scientific article
Language Label Description Also known as
English
A computational study for bilevel quadratic programs using semidefinite relaxations
scientific article

    Statements

    A computational study for bilevel quadratic programs using semidefinite relaxations (English)
    0 references
    0 references
    0 references
    7 October 2016
    0 references
    conic programming and interior point methods
    0 references
    bilevel programming
    0 references
    semidefinite programming
    0 references
    mixed integer linear programming
    0 references
    0 references

    Identifiers