Pages that link to "Item:Q3396396"
From MaRDI portal
The following pages link to GloptiPoly 3: moments, optimization and semidefinite programming (Q3396396):
Displaying 50 items.
- Minimizing the sum of many rational functions (Q266410) (← links)
- Positive semi-definiteness and sum-of-squares property of fourth order four dimensional Hankel tensors (Q268358) (← links)
- Global optimization with spline constraints: a new branch-and-bound method based on B-splines (Q300751) (← links)
- Computing the distance between the linear matrix pencil and the completely positive cone (Q301674) (← links)
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- Borel measures with a density on a compact semi-algebraic set (Q382256) (← links)
- Nonlinear \(H_\infty\) feedback control with integrator for polynomial discrete-time systems (Q402005) (← links)
- Optimality conditions and finite convergence of Lasserre's hierarchy (Q403636) (← links)
- Copositivity and constrained fractional quadratic problems (Q403649) (← links)
- An efficient DC programming approach for portfolio decision with higher moments (Q409263) (← links)
- On the synthesis of linear \(H_\infty\) filters for polynomial systems (Q450688) (← links)
- Robust control of uncertain systems: classical results and recent developments (Q458745) (← links)
- Design of Marx generators as a structured eigenvalue assignment (Q472612) (← links)
- The \(\mathcal A\)-truncated \(K\)-moment problem (Q486690) (← links)
- Three dimensional strongly symmetric circulant tensors (Q492775) (← links)
- A generalization of Löwner-John's ellipsoid theorem (Q494343) (← links)
- Modeling probability densities with sums of exponentials via polynomial approximation (Q495127) (← links)
- Global optimality conditions and optimization methods for polynomial programming problems (Q496629) (← links)
- A semidefinite algorithm for completely positive tensor decomposition (Q513715) (← links)
- Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization (Q517310) (← links)
- Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization (Q522270) (← links)
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints (Q607501) (← links)
- On the complexity of computing the handicap of a sufficient matrix (Q644911) (← links)
- Min-max and robust polynomial optimization (Q652661) (← links)
- Discriminants and nonnegative polynomials (Q655567) (← links)
- Semidefinite programming for min-max problems and games (Q662286) (← links)
- A polynomial optimization approach to constant rebalanced portfolio selection (Q694522) (← links)
- Approximation algorithms for nonnegative polynomial optimization problems over unit spheres (Q721466) (← links)
- Mean squared error minimization for inverse moment problems (Q741143) (← links)
- Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities (Q742119) (← links)
- A semidefinite programming approach for solving multiobjective linear programming (Q742135) (← links)
- Monotonically positive matrices (Q745213) (← links)
- Linear optimization with cones of moments and nonnegative polynomials (Q745685) (← links)
- Signomial and polynomial optimization via relative entropy and partial dualization (Q823883) (← links)
- A discussion of probability functions and constraints from a variational perspective (Q829489) (← links)
- Moments and sums of squares for polynomial optimization and related problems (Q842714) (← links)
- Semidefinite programming and sums of Hermitian squares of noncommutative polynomials (Q847674) (← links)
- Partially positive matrices (Q892772) (← links)
- Interiors of completely positive cones (Q897047) (← links)
- Modal occupation measures and LMI relaxations for nonlinear switched systems control (Q899277) (← links)
- Completely positive tensor recovery with minimal nuclear value (Q1639713) (← links)
- Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity (Q1646680) (← links)
- Nonlinear state feedback control for a class of polynomial nonlinear discrete-time systems with norm-bounded uncertainties: an integrator approach (Q1659377) (← links)
- Tensor eigenvalue complementarity problems (Q1659680) (← links)
- Global optimality conditions and optimization methods for constrained polynomial programming problems (Q1663418) (← links)
- UTA-poly and UTA-splines: additive value functions with polynomial marginals (Q1681484) (← links)
- Algorithms for the orthographic-\(n\)-point problem (Q1703170) (← links)
- (Sub-)differentiability of probability functions with elliptical distributions (Q1711093) (← links)
- Approximate optimal designs for multivariate polynomial regression (Q1731748) (← links)
- Degeneracy of the intersection of three quadrics (Q1735947) (← links)
