Algorithm 996 (Q4960955): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(12 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: SDPA / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SparsePOP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Matlab / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SCIP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GloptiPoly / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SDPNAL+ / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SeDuMi / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SDPT3 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Mosek / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2964648808 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1804.00761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some applications of polynomial optimization in operations research and real-time decision making / 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: On Lagrangian Relaxation of Quadratic Matrix Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A robust Lagrangian-DNN method for a class of quadratic optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4963668 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5148358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4830373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4288578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Moreau's decomposition in Banach spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: GloptiPoly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5361279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular Function Minimization under Covering Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimization with Polynomials and the Problem of Moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3395491 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bounded degree SOS hierarchy for polynomial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive accelerated first-order method for convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3845569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3320132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularization Methods for SDP Relaxations in Large-Scale Polynomial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive restart for accelerated gradient schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: ADMM for the SDP relaxation of the QAP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxations for semialgebraic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Copositive Programming Approach to Graph Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Copositive and semidefinite relaxations of the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving semidefinite-quadratic-linear programs using SDPT3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy approximations for minimum submodular cover with submodular cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity / rank
 
Normal rank
Property / cites work
 
Property / cites work: SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxations for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Newton-CG Augmented Lagrangian Method for Semidefinite Programming / rank
 
Normal rank

Latest revision as of 12:53, 22 July 2024

scientific article; zbMATH DE number 7193383
Language Label Description Also known as
English
Algorithm 996
scientific article; zbMATH DE number 7193383

    Statements

    Algorithm 996 (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    24 April 2020
    0 references
    Matlab software package
    0 references
    bisection and projection methods
    0 references
    box and complementarity constraints
    0 references
    efficiency
    0 references
    hierarchy of doubly nonnegative relaxations
    0 references
    high-degree polynomial optimization problems with binary
    0 references
    sparsity
    0 references
    tight lower bounds
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers