Hardness and Approximation Results for Lp-Ball Constrained Homogeneous Polynomial Optimization Problems (Q5247613): Difference between revisions

Latest revision as of 00:52, 10 July 2024

scientific article; zbMATH DE number 6430555

Language	Label	Description	Also known as
English	Hardness and Approximation Results for <i>L<sub>p</sub></i>-Ball Constrained Homogeneous Polynomial Optimization Problems	scientific article; zbMATH DE number 6430555

Statements

instance of

scholarly article

0 references

title

Hardness and Approximation Results for Lp-Ball Constrained Homogeneous Polynomial Optimization Problems (English)

0 references

0 references

0 references

Mathematics of Operations Research

0 references

publication date

24 April 2015

0 references

full work available at URL

https://arxiv.org/abs/1210.8284

0 references

zbMATH Keywords

polynomial optimization

0 references

approximation algorithms

0 references

algorithmic convex geometry

0 references

convex programming

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

NP-hardness of deciding convexity of quartic polynomials and related problems

0 references

Approximating the Cut-Norm via Grothendieck's Inequality

0 references

Q4236163

0 references

Integration and optimization of multivariate polynomials by restriction onto a random subspace

0 references

On Polyhedral Approximations of the Second-Order Cone

0 references

Q5365059

0 references

The Grothendieck Constant is Strictly Smaller than Krivine's Bound

0 references

Deterministic and randomized polynomial‐time approximation of radii

0 references

A PTAS for the minimization of polynomials of fixed degree over the simplex

0 references

Probability Bounds for Polynomial Functions in Random Variables

0 references

Approximation algorithms for homogeneous polynomial optimization with quadratic constraints

0 references

Most Tensor Problems Are NP-Hard

0 references

Linear Equations Modulo 2 and the $L_1$ Diameter of Convex Bodies

0 references

Grothendieck-Type Inequalities in Combinatorial Optimization

0 references

The UGC Hardness Threshold of the Lp Grothendieck Problem

0 references

Semidefinite relaxation approximation for multivariate bi‐quadratic optimization with quadratic constraints

0 references

Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations

0 references

A Semidefinite Relaxation Scheme for Multivariate Quartic Polynomial Optimization with Quadratic Constraints

0 references

Norm attaining polynomials

0 references

Grothendieck’s Theorem, past and present

0 references

Eigenvalues of a real supersymmetric tensor

0 references

Block tensors and symmetric embeddings

0 references

Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems

0 references

On approximating complex quadratic optimization problems via semidefinite programming relaxations

0 references

On solving biquadratic optimization via semidefinite relaxation

0 references

Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints

0 references

The cubic spherical optimization problems

0 references

Identifiers

zbMATH Open document ID

1310.90091

0 references

DOI

10.1287/moor.2014.0644

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5247613

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2153145191
@@ Property / OpenAlex ID: W2153145191 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.8284
@@ Property / arXiv ID: 1210.8284 / rank @@
+Normal rank
@@ Property / cites work @@
+NP-hardness of deciding convexity of quartic polynomials and related problems
+Normal rank
@@ Property / cites work @@
+Approximating the Cut-Norm via Grothendieck's Inequality
+Normal rank
@@ Property / cites work @@
+Q4236163
@@ Property / cites work: Q4236163 / rank @@
+Normal rank
@@ Property / cites work @@
+Integration and optimization of multivariate polynomials by restriction onto a random subspace
+Normal rank
@@ Property / cites work @@
+On Polyhedral Approximations of the Second-Order Cone
+Normal rank
@@ Property / cites work @@
+Q5365059
@@ Property / cites work: Q5365059 / rank @@
+Normal rank
@@ Property / cites work @@
+The Grothendieck Constant is Strictly Smaller than Krivine's Bound
+Normal rank
@@ Property / cites work @@
+Deterministic and randomized polynomial‐time approximation of radii
+Normal rank
@@ Property / cites work @@
+A PTAS for the minimization of polynomials of fixed degree over the simplex
+Normal rank
@@ Property / cites work @@
+Probability Bounds for Polynomial Functions in Random Variables
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
+Normal rank
@@ Property / cites work @@
+Most Tensor Problems Are NP-Hard
@@ Property / cites work: Most Tensor Problems Are NP-Hard / rank @@
+Normal rank
@@ Property / cites work @@
+Linear Equations Modulo 2 and the $L_1$ Diameter of Convex Bodies
+Normal rank
@@ Property / cites work @@
+Grothendieck-Type Inequalities in Combinatorial Optimization
+Normal rank
@@ Property / cites work @@
+The UGC Hardness Threshold of the <i>L<sub>p</sub></i> Grothendieck Problem
+Normal rank
@@ Property / cites work @@
+Semidefinite relaxation approximation for multivariate bi‐quadratic optimization with quadratic constraints
+Normal rank
@@ Property / cites work @@
+Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
+Normal rank
@@ Property / cites work @@
+A Semidefinite Relaxation Scheme for Multivariate Quartic Polynomial Optimization with Quadratic Constraints
+Normal rank
@@ Property / cites work @@
+Norm attaining polynomials
@@ Property / cites work: Norm attaining polynomials / rank @@
+Normal rank
@@ Property / cites work @@
+Grothendieck’s Theorem, past and present
@@ Property / cites work: Grothendieck’s Theorem, past and present / rank @@
+Normal rank
@@ Property / cites work @@
+Eigenvalues of a real supersymmetric tensor
@@ Property / cites work: Eigenvalues of a real supersymmetric tensor / rank @@
+Normal rank
@@ Property / cites work @@
+Block tensors and symmetric embeddings
@@ Property / cites work: Block tensors and symmetric embeddings / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
+Normal rank
@@ Property / cites work @@
+On approximating complex quadratic optimization problems via semidefinite programming relaxations
+Normal rank
@@ Property / cites work @@
+On solving biquadratic optimization via semidefinite relaxation
+Normal rank
@@ Property / cites work @@
+Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints
+Normal rank
@@ Property / cites work @@
+The cubic spherical optimization problems
@@ Property / cites work: The cubic spherical optimization problems / rank @@
+Normal rank

Hardness and Approximation Results for <i>L<sub>p</sub></i>-Ball Constrained Homogeneous Polynomial Optimization Problems (Q5247613): Difference between revisions

Latest revision as of 00:52, 10 July 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)