Pages that link to "Item:Q5757351"

The following pages link to Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity (Q5757351):

Displaying 45 items.

• A convex relaxation approach to set-membership identification of LPV systems (Q2628501) (← links)
• Solving polynomial least squares problems via semidefinite programming relaxations (Q2655337) (← links)
• Sum-of-squares chordal decomposition of polynomial matrix inequalities (Q2689814) (← links)
• Exploiting sparsity for semi-algebraic set volume computation (Q2696572) (← links)
• Robustness to Dependency in Portfolio Optimization Using Overlapping Marginals (Q2797466) (← links)
• Introduction to Semidefinite, Conic and Polynomial Optimization (Q2802517) (← links)
• Positivity and Optimization: Beyond Polynomials (Q2802532) (← links)
• Exploiting Sparsity in SDP Relaxation of Polynomial Optimization Problems (Q2802536) (← links)
• Perturbed sums-of-squares theorem for polynomial optimization and its applications (Q2811486) (← links)
• Improved parameter bounds for set-membership EIV problems (Q3008831) (← links)
• Semidefinite Approximations of Projections and Polynomial Images of SemiAlgebraic Sets (Q3451759) (← links)
• SDP RELAXATIONS FOR QUADRATIC OPTIMIZATION PROBLEMS DERIVED FROM POLYNOMIAL OPTIMIZATION PROBLEMS (Q3560105) (← links)
• Exact Certification in Global Polynomial Optimization Via Rationalizing Sums-Of-Squares (Q3576578) (← links)
• A Multigrid Approach to SDP Relaxations of Sparse Polynomial Optimization Problems (Q4600837) (← links)
• Bounds on mean energy in the Kuramoto–Sivashinsky equation computed using semidefinite programming (Q4632034) (← links)
• LP Formulations for Polynomial Optimization Problems (Q4637509) (← links)
• Bounding the parameters of block‐structured nonlinear feedback systems (Q4921760) (← links)
• Algorithm 996 (Q4960955) (← links)
• (Q4963653) (← links)
• Dual Certificates and Efficient Rational Sum-of-Squares Decompositions for Polynomial Optimization over Compact Sets (Q5043282) (← links)
• Symmetry Reduction in AM/GM-Based Optimization (Q5080501) (← links)
• Cutting Plane Generation through Sparse Principal Component Analysis (Q5081781) (← links)
• Optimization on the Euclidean Unit Sphere (Q5087107) (← links)
• TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity (Q5148403) (← links)
• Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension (Q5148406) (← links)
• Minimizing Rational Functions: A Hierarchy of Approximations via Pushforward Measures (Q5152480) (← links)
• Optimizing ordered median functions with applications to single facility location (Q5176324) (← links)
• LP relaxations for a class of linear semi-infinite programming problems (Q5277959) (← links)
• Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients (Q5883314) (← links)
• Partial Lasserre relaxation for sparse Max-Cut (Q6050383) (← links)
• A hierarchy of spectral relaxations for polynomial optimization (Q6062883) (← links)
• Semidefinite Relaxation Methods for Tensor Absolute Value Equations (Q6066099) (← links)
• A unified framework for the identification of a general class of multivariable nonlinear block‐structured systems (Q6071510) (← links)
• A new scheme for approximating the weakly efficient solution set of vector rational optimization problems (Q6109053) (← links)
• Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks (Q6126663) (← links)
• A Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial Optimization (Q6136658) (← links)
• Construction of Multivariate Polynomial Approximation Kernels via Semidefinite Programming (Q6155879) (← links)
• Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022 (Q6170529) (← links)
• Reducing nonnegativity over general semialgebraic sets to nonnegativity over simple sets (Q6561376) (← links)
• Global minimization of polynomial integral functionals (Q6573176) (← links)
• The moment-SOS hierarchy: applications and related topics (Q6598421) (← links)
• Exploiting constant trace property in large-scale polynomial optimization (Q6599981) (← links)
• CS-TSSOS: correlative and term sparsity for large-scale polynomial optimization (Q6599983) (← links)
• Hierarchy relaxations for robust equilibrium constrained polynomial problems and applications to electric vehicle charging scheduling (Q6631573) (← links)
• Convergence rates for sums-of-squares hierarchies with correlative sparsity (Q6665388) (← links)