Solving polynomial least squares problems via semidefinite programming relaxations (Q2655337): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: tn / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: minpack / 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/s10898-009-9405-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2033005587 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4288578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SDPLIB 1.2, a library of semidefinite programming test problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: CUTEr and SifDec / rank
 
Normal rank
Property / cites work
 
Property / cites work: GloptiPoly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergent Relaxations of Polynomial Matrix Inequalities and Static Output Feedback / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix sum-of-squares relaxations for robust semi-definite programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Approximations for Global Unconstrained Polynomial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing underlying sparsity in optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: SPARSE SECOND ORDER CONE PROGRAMMING FORMULATIONS FOR CONVEX OPTIMIZATION PROBLEMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones / 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: Q4060751 / 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: Solving polynomial systems by polyhedral homotopies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Unconstrained Optimization Software / rank
 
Normal rank
Property / cites work
 
Property / cites work: Newton-Type Minimization via the Lanczos Method / 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: SDPT3 — A Matlab software package for semidefinite programming, Version 1.3 / 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

Latest revision as of 09:26, 2 July 2024

scientific article
Language Label Description Also known as
English
Solving polynomial least squares problems via semidefinite programming relaxations
scientific article

    Statements

    Solving polynomial least squares problems via semidefinite programming relaxations (English)
    0 references
    0 references
    0 references
    25 January 2010
    0 references
    polynomial second-order cone programs
    0 references
    sparsity
    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