Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets (Q288220): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(8 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Vaithilingam Jeyakumar / rank
Normal rank
 
Property / author
 
Property / author: Gue Myung Lee / rank
Normal rank
 
Property / author
 
Property / author: Vaithilingam Jeyakumar / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59241452 / 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: SFSDP / 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.1007/s10898-015-0356-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1196354647 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning procedure for polynomial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decoding by Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhancing sparsity by reweighted \(\ell _{1}\) minimization / 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: The \(K\)-moment problem for compact semi-algebraic sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints / 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: Representations of Positive Polynomials and Optimization on Noncompact Semialgebraic Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On polynomial optimization over non-compact semi-algebraic sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new class of alternative theorems for SOS-convex inequalities and robust optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact SDP relaxations for classes of nonlinear semidefinite programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 920 / 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: 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: Q5452017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sum of squares method for sensor network localization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact Jacobian SDP relaxation for polynomial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality conditions and finite convergence of Lasserre's hierarchy / 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: Q4285035 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sums of squares on real algebraic curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimization of Polynomials Using Gradient Tentacles and Sums of Squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mathematical introduction to compressive sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones / rank
 
Normal rank

Revision as of 00:47, 12 July 2024

scientific article
Language Label Description Also known as
English
Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets
scientific article

    Statements

    Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    25 May 2016
    0 references
    global continuous optimization
    0 references
    sparse polynomial optimization
    0 references
    structured sparsity
    0 references
    sums of squares polynomials
    0 references
    semidefinite programming relaxations
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers