Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations (Q645557): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57445456, #quickstatements; #temporary_batch_1711196317277
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A relaxation method for nonconvex quadratically constrained quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: D.C. versus copositive bounds for standard QP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and cut algorithm for nonconvex quadratically constrained quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4830373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-bound approaches to standard quadratic optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On copositive programming and standard quadratic optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undominated d.c. decompositions of quadratic functions and applications to branch-and-bound approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxation for nonconvex quadratic programs / 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: An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Second order cone programming relaxation of nonconvex quadratic optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a class of linearly constrained indefinite quadratic problems by DC algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combined d.c. optimization--ellipsoidal branch-and-bound algorithm for solving nonconvex quadratic programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a Trust Region Step / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite relaxation and nonconvex quadratic optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global minimization of indefinite quadratic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained global optimization: algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic programming with one negative eigenvalue is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3491318 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Relaxations of (0, 1)-Quadratic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplicial branch-and-bound method for solving nonconvex all-quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global minimization of large-scale constrained concave quadratic problems by separable programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: BARON: A general purpose global optimization software package / 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: A reformulation-linearization technique for solving discrete and continuous nonconvex problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhancing RLT relaxations via a new class of semidefinite cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3802887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating global quadratic optimization with convex quadratic constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic maximization and semidefinite relaxation / rank
 
Normal rank

Revision as of 15:46, 4 July 2024

scientific article
Language Label Description Also known as
English
Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
scientific article

    Statements

    Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations (English)
    0 references
    0 references
    8 November 2011
    0 references
    nonconvex quadratically constrained quadratic programming
    0 references
    optimal D.C. decomposition
    0 references
    semidefinite program
    0 references
    piecewise linear approximation
    0 references
    feasible solution
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers