Completely positive reformulations of polynomial optimization problems with linear constraints (Q1679621): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11590-017-1123-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2594479200 / rank
 
Normal rank
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: Extension of completely positive cone relaxation to moment cone relaxation for polynomial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On conic QPCCs, conic QCQPs and completely positive programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Copositive optimization -- recent developments and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization / 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: Copositive Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representing quadratically constrained quadratic programs as generalized copositive programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum Block Improvement and Polynomial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric Tensor Approximation Hierarchies for the Completely Positive Cone / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completely positive reformulations for polynomial optimization / 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: Moments and sums of squares for polynomial optimization and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear operators and positive semidefiniteness of symmetric tensor spaces / 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: Nonnegative Tensor Factorization, Completely Positive Tensors, and a Hierarchical Elimination Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variational Analysis / rank
 
Normal rank

Latest revision as of 17:28, 14 July 2024

scientific article
Language Label Description Also known as
English
Completely positive reformulations of polynomial optimization problems with linear constraints
scientific article

    Statements

    Completely positive reformulations of polynomial optimization problems with linear constraints (English)
    0 references
    0 references
    0 references
    9 November 2017
    0 references
    0 references
    polynomial optimization
    0 references
    completely positive tensors
    0 references
    completely positive relaxations
    0 references
    0 references