Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods (Q1730782): Difference between revisions

From MaRDI portal
Changed an Item
Created claim: Wikidata QID (P12): Q129055345, #quickstatements; #temporary_batch_1726323884171
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: SDPT3 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10957-018-1416-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2897697015 / 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: Semidefinite Programming / 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: Quadratic maximization and semidefinite relaxation / 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: Branch-and-bound approaches to standard quadratic optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Feasible Active Set Method with Reoptimization for Convex Quadratic Mixed-Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations / 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: A reformulation-linearization technique for solving discrete and continuous nonconvex problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for nonconvex quadratic programs with box constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4801579 / 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: Semidefinite relaxation and nonconvex quadratic optimization / 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: On maximization of quadratic form over intersection of ellipsoids with common center / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ruling Out PTAS for Graph Min‐Bisection, Dense k‐Subgraph, and Bipartite Clique / 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: 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: Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Copositive realxation for genera quadratic 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: Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable representations for convex hulls of low-dimensional quadratic forms / 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: Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the gap between the quadratic integer programming problem and its semidefinite relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On The Reduction of Duality Gap in Box Constrained Nonconvex Quadratic Program / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonlinear semidefinite optimization relaxation for the worst-case linear optimization under uncertainties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set-valued analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SDPT3 — A Matlab software package for semidefinite programming, Version 1.3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The nonlinear knapsack problem - algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Selection Problem of Shared Fixed Costs and Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Maximum Clique by Removing Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quadratic knapsack problem -- a survey / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129055345 / rank
 
Normal rank

Latest revision as of 15:26, 14 September 2024

scientific article
Language Label Description Also known as
English
Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods
scientific article

    Statements

    Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods (English)
    0 references
    0 references
    0 references
    0 references
    6 March 2019
    0 references
    quadratic programming
    0 references
    conditionally quasi-convex relaxation
    0 references
    iterative search
    0 references
    bisection search
    0 references
    penalty method
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers