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

@@ Property / cites work @@
+Q4288578
@@ Property / cites work: Q4288578 / rank @@
+Normal rank
@@ Property / cites work @@
+SDPLIB 1.2, a library of semidefinite programming test problems
+Normal rank
@@ Property / cites work @@
+On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds
+Normal rank
@@ Property / cites work @@
+An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds
+Normal rank
@@ Property / cites work @@
+Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables
+Normal rank
@@ Property / cites work @@
+CUTEr and SifDec
@@ Property / cites work: CUTEr and SifDec / rank @@
+Normal rank
@@ Property / cites work @@
+GloptiPoly
@@ Property / cites work: GloptiPoly / rank @@
+Normal rank
@@ Property / cites work @@
+Convergent Relaxations of Polynomial Matrix Inequalities and Static Output Feedback
+Normal rank
@@ Property / cites work @@
+Matrix sum-of-squares relaxations for robust semi-definite programs
+Normal rank
@@ Property / cites work @@
+Semidefinite Approximations for Global Unconstrained Polynomial Optimization
+Normal rank
@@ Property / cites work @@
+Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems
+Normal rank
@@ Property / cites work @@
+Recognizing underlying sparsity in optimization
@@ Property / cites work: Recognizing underlying sparsity in optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP
+Normal rank
@@ Property / cites work @@
+SPARSE SECOND ORDER CONE PROGRAMMING FORMULATIONS FOR CONVEX OPTIMIZATION PROBLEMS
+Normal rank
@@ Property / cites work @@
+An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones
+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 @@
+Sparsity in sums of squares of polynomials
@@ Property / cites work: Sparsity in sums of squares of polynomials / rank @@
+Normal rank
@@ Property / cites work @@
+Q4060751
@@ Property / cites work: Q4060751 / rank @@
+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 @@
+Solving polynomial systems by polyhedral homotopies
+Normal rank
@@ Property / cites work @@
+Testing Unconstrained Optimization Software
@@ Property / cites work: Testing Unconstrained Optimization Software / rank @@
+Normal rank
@@ Property / cites work @@
+Newton-Type Minimization via the Lanczos Method
@@ Property / cites work: Newton-Type Minimization via the Lanczos Method / rank @@
+Normal rank
@@ Property / cites work @@
+Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
+Normal rank
@@ Property / cites work @@
+SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
+Normal rank
@@ Property / cites work @@
+Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
+Normal rank