On zero duality gap in nonconvex quadratic programming problems (Q421278): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57445448, #quickstatements; #temporary_batch_1711055989931
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Reverse search for enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hidden convexity in some nonconvex quadratically constrained quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing optimality for quadratic 0-1 problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new linearization technique for multi-quadratic 0-1 programming problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the stability of a dual weak vector variational inequality problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5675212 / 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: Solutions and optimality criteria for nonconvex constrained global optimization problems with connections between canonical and Lagrangian duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditions for global optimality. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions / 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: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Seizure warning algorithm based on optimization and nonlinear dynamics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global minimization of indefinite quadratic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753185 / 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: Sufficient global optimality conditions for bivalent quadratic optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of the S-Lemma / 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: Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4719331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global extremal conditions for multi-integer quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimality conditions for mixed nonconvex quadratic programs† / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient conditions for global optimality of bivalent nonconvex quadratic programs with inequality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Results on Quadratic Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facing up to arrangements: face-count formulas for partitions of space by hyperplanes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic maximization and semidefinite relaxation / rank
 
Normal rank

Latest revision as of 07:07, 5 July 2024

scientific article
Language Label Description Also known as
English
On zero duality gap in nonconvex quadratic programming problems
scientific article

    Statements

    On zero duality gap in nonconvex quadratic programming problems (English)
    0 references
    0 references
    0 references
    23 May 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    nonconvex quadratic program
    0 references
    Lagrangian dual
    0 references
    SDP relaxation
    0 references
    duality gap
    0 references
    sufficient conditions
    0 references
    cell enumeration
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references