Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints (Q2144550): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5148358 / 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: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Active set algorithms for isotonic regression; a unifying framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4288578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing a polyhedral-semidefinite relaxation of completely positive programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating doubly nonnegative and completely positive matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Doubly Positive Semidefinite Programming Relaxations / 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: Algorithm 996 / 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: Q4537750 / 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: A bounded degree SOS hierarchy for polynomial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3845569 / 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: Algorithms for a class of isotonic regression problems / 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: 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: A primal barrier function phase I algorithm for nonsymmetric conic optimization problems / rank
 
Normal rank

Revision as of 07:31, 29 July 2024

scientific article
Language Label Description Also known as
English
Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints
scientific article

    Statements

    Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints (English)
    0 references
    0 references
    0 references
    0 references
    14 June 2022
    0 references
    polynomial optimization problems with nonnegative variables
    0 references
    doubly nonnegative relaxations
    0 references
    a class of polyhedral cones
    0 references
    the bisection and projection algorithm
    0 references
    computational efficiency and tight 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

    Identifiers