Pages that link to "Item:Q5757351"

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

Displaying 28 items.

• Minimizing the sum of many rational functions (Q266410) (← links)
• Amoebas, nonnegative polynomials and sums of squares supported on circuits (Q268411) (← links)
• Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets (Q288220) (← links)
• Continuous multifacility ordered median location problems (Q322399) (← links)
• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
• RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems (Q340017) (← links)
• Bounded error identification of Hammerstein systems through sparse polynomial optimization (Q361063) (← links)
• Welfare-maximizing correlated equilibria using Kantorovich polynomials with sparsity (Q367164) (← links)
• Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality (Q386447) (← links)
• The \(\mathcal A\)-truncated \(K\)-moment problem (Q486690) (← links)
• Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization (Q522270) (← links)
• Partitioning procedure for polynomial optimization (Q604960) (← links)
• Optimizing \(n\)-variate \((n+k)\)-nomials for small \(k\) (Q633624) (← links)
• Min-max and robust polynomial optimization (Q652661) (← links)
• Semidefinite programming for min-max problems and games (Q662286) (← links)
• A polynomial optimization approach to constant rebalanced portfolio selection (Q694522) (← links)
• Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion (Q717129) (← links)
• Bounds on mean energy in the Kuramoto–Sivashinsky equation computed using semidefinite programming (Q4632034) (← links)
• Bounding the parameters of block‐structured nonlinear feedback systems (Q4921760) (← 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)