Approximate gcds of polynomials and sparse SOS relaxations (Q2378493): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2008.09.003 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: Sostools / 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: YALMIP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SeDuMi / 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.1016/j.tcs.2008.09.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2142099171 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4232503 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226951 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting Global Optimality and Extracting Solutions in GloptiPoly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4232504 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of rational functions: a semidefinite programming approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227320 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximate GCDs of univariate polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsity in sums of squares of polynomials / 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: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global minimization of rational functions and the nearest GCDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4428719 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal psd forms with few terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Class of global minimum bounds of polynomial functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modified \(r\)-algorithm to find the global minimum of polynomial functions / 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: Semidefinite Programming / 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: Handbook of semidefinite programming. Theory, algorithms, and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid method for computing the nearest singular polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearest singular polynomials / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2008.09.003 / rank
 
Normal rank

Latest revision as of 07:11, 18 December 2024

scientific article
Language Label Description Also known as
English
Approximate gcds of polynomials and sparse SOS relaxations
scientific article

    Statements

    Approximate gcds of polynomials and sparse SOS relaxations (English)
    0 references
    0 references
    0 references
    0 references
    8 January 2009
    0 references
    greatest common divisor
    0 references
    sums of squares
    0 references
    semidefinite programming
    0 references
    global minimization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references