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

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

instance of

scholarly article

0 references

title

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

Vaithilingam Jeyakumar

0 references

published in

Journal of Global Optimization

0 references

publication date

25 May 2016

0 references

zbMATH Keywords

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

describes a project that uses

0 references

0 references

0 references

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10898-015-0356-6

0 references

cites work

Partitioning procedure for polynomial optimization

0 references

From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images

0 references

Decoding by Linear Programming

0 references

Enhancing sparsity by reweighted \(\ell _{1}\) minimization

0 references

Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials

0 references

The \(K\)-moment problem for compact semi-algebraic sets

0 references

Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints

0 references

Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework

0 references

Representations of Positive Polynomials and Optimization on Noncompact Semialgebraic Sets

0 references

On polynomial optimization over non-compact semi-algebraic sets

0 references

Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness

0 references

A new class of alternative theorems for SOS-convex inequalities and robust optimization

0 references

Exact SDP relaxations for classes of nonlinear semidefinite programming problems

0 references

Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion

0 references

Algorithm 920

0 references

A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones

0 references

Global Optimization with Polynomials and the Problem of Moments

0 references

Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity

0 references

Q5452017

0 references

Sum of squares method for sensor network localization

0 references

An exact Jacobian SDP relaxation for polynomial optimization

0 references

Optimality conditions and finite convergence of Lasserre's hierarchy

0 references

Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity

0 references

Q4285035

0 references

Sums of squares on real algebraic curves

0 references

Global Optimization of Polynomials Using Gradient Tentacles and Sums of Squares

0 references

A mathematical introduction to compressive sensing

0 references

Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones

0 references

Identifiers

zbMATH Open document ID

1369.90136

0 references

DOI

10.1007/s10898-015-0356-6

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:288220

@@ Property / describes a project that uses @@
+SeDuMi
@@ Property / describes a project that uses: SeDuMi / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10898-015-0356-6
+Normal rank
@@ Property / OpenAlex ID @@
+W1196354647
@@ Property / OpenAlex ID: W1196354647 / rank @@
+Normal rank
@@ Property / cites work @@
+Partitioning procedure for polynomial optimization
+Normal rank
@@ Property / cites work @@
+From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
+Normal rank
@@ Property / cites work @@
+Decoding by Linear Programming
@@ Property / cites work: Decoding by Linear Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Enhancing sparsity by reweighted \(\ell _{1}\) minimization
+Normal rank
@@ Property / cites work @@
+Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
+Normal rank
@@ Property / cites work @@
+The \(K\)-moment problem for compact semi-algebraic sets
+Normal rank
@@ Property / cites work @@
+Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints
+Normal rank
@@ Property / cites work @@
+Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework
+Normal rank
@@ Property / cites work @@
+Representations of Positive Polynomials and Optimization on Noncompact Semialgebraic Sets
+Normal rank
@@ Property / cites work @@
+On polynomial optimization over non-compact semi-algebraic sets
+Normal rank
@@ Property / cites work @@
+Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness
+Normal rank
@@ Property / cites work @@
+A new class of alternative theorems for SOS-convex inequalities and robust optimization
+Normal rank
@@ Property / cites work @@
+Exact SDP relaxations for classes of nonlinear semidefinite programming problems
+Normal rank
@@ Property / cites work @@
+Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
+Normal rank
@@ Property / cites work @@
+Algorithm 920
@@ Property / cites work: Algorithm 920 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones
+Normal rank
@@ Property / cites work @@
+Global Optimization with Polynomials and the Problem of Moments
+Normal rank
@@ Property / cites work @@
+Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
+Normal rank
@@ Property / cites work @@
+Q5452017
@@ Property / cites work: Q5452017 / rank @@
+Normal rank
@@ Property / cites work @@
+Sum of squares method for sensor network localization
+Normal rank
@@ Property / cites work @@
+An exact Jacobian SDP relaxation for polynomial optimization
+Normal rank
@@ Property / cites work @@
+Optimality conditions and finite convergence of Lasserre's hierarchy
+Normal rank
@@ Property / cites work @@
+Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
+Normal rank
@@ Property / cites work @@
+Q4285035
@@ Property / cites work: Q4285035 / rank @@
+Normal rank
@@ Property / cites work @@
+Sums of squares on real algebraic curves
@@ Property / cites work: Sums of squares on real algebraic curves / rank @@
+Normal rank
@@ Property / cites work @@
+Global Optimization of Polynomials Using Gradient Tentacles and Sums of Squares
+Normal rank
@@ Property / cites work @@
+A mathematical introduction to compressive sensing
+Normal rank
@@ Property / cites work @@
+Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
+Normal rank