Pages that link to "Item:Q2706355"
From MaRDI portal
The following pages link to Global optimization with polynomials and the problem of moments (Q2706355):
Displaying 50 items.
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 (Q1731962) (← links)
- Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials (Q1733314) (← links)
- A multilevel analysis of the Lasserre hierarchy (Q1735163) (← links)
- A robust unscented transformation for uncertain moments (Q1738657) (← links)
- New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation (Q1741128) (← links)
- Optimization over structured subsets of positive semidefinite matrices via column generation (Q1751222) (← links)
- Binary quadratic optimization problems that are difficult to solve by conic relaxations (Q1751225) (← links)
- A continuous characterization of the maximum vertex-weighted clique in hypergraphs (Q1752628) (← links)
- Real eigenvalues of nonsymmetric tensors (Q1753066) (← links)
- Tensor maximal correlation problems (Q1753137) (← links)
- Polynomial optimization for water networks: global solutions for the valve setting problem (Q1753591) (← links)
- Exploiting algebraic structure in global optimization and the Belgian chocolate problem (Q1756771) (← links)
- An improved semidefinite programming relaxation for the satisfiability problem (Q1774165) (← links)
- Sparsity in sums of squares of polynomials (Q1777218) (← links)
- Inverse conic programming with applications (Q1779714) (← links)
- Method for constructing Stieltjes classes for \(M\)-indeterminate probability distributions (Q1780524) (← links)
- Parametrized matrix inequalities in analysis of linear dynamic systems (Q1785067) (← links)
- Approximating Pareto curves using semidefinite relaxations (Q1785276) (← links)
- A MAX-CUT formulation of 0/1 programs (Q1785732) (← links)
- A dynamic game approach to distributionally robust safety specifications for stochastic systems (Q1797093) (← links)
- Semidefinite and linear programming integrality gaps for scheduling identical machines (Q1800998) (← links)
- Symmetry groups, semidefinite programs, and sums of squares (Q1878418) (← links)
- Ellipsoidal bounds for uncertain linear equations and dynamical systems (Q1879588) (← links)
- How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization (Q1926632) (← links)
- A ``joint + marginal'' heuristic for 0/1 programs (Q1928265) (← links)
- Global optimization of polynomial-expressed nonlinear optimal control problems with semidefinite programming relaxation (Q1928270) (← links)
- A semidefinite approach for truncated \(K\)-moment problems (Q1928277) (← links)
- Computation of polytopic invariants for polynomial dynamical systems using linear programming (Q1932703) (← links)
- The membership problem for finitely generated quadratic modules in the univariate case (Q1934974) (← links)
- Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization (Q1935573) (← links)
- On solving biquadratic optimization via semidefinite relaxation (Q1935575) (← links)
- An algorithm for semi-infinite polynomial optimization (Q1935882) (← links)
- The moment problem for continuous positive semidefinite linear functionals (Q1936506) (← links)
- Exact SDP relaxations for classes of nonlinear semidefinite programming problems (Q1939707) (← links)
- Multi-parametric disaggregation technique for global optimization of polynomial programming problems (Q1941031) (← links)
- An exact Jacobian SDP relaxation for polynomial optimization (Q1942264) (← links)
- The tracial moment problem and trace-optimization of polynomials (Q1942272) (← links)
- Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization (Q1949261) (← links)
- A perfect example for the BFGS method (Q1949264) (← links)
- Solution to singular optimal control by backward differential flow (Q1953741) (← links)
- Convex underestimators of polynomials (Q1955542) (← links)
- Positive hybrid real-trigonometric polynomials and applications to adjustable filter design and absolute stability analysis (Q1959357) (← links)
- On sums of squares of \(K\)-nomials (Q1979337) (← links)
- Optimization and stabilization of hierarchical electrical networks (Q1979700) (← links)
- An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming (Q1994127) (← links)
- The tracial moment problem on quadratic varieties (Q1998623) (← links)
- An adaptive procedure for the global minimization of a class of polynomial functions (Q2004881) (← links)
- An SDP method for copositivity of partially symmetric tensors (Q2007119) (← links)
- On the exactness of Lasserre relaxations and pure states over real closed fields (Q2007851) (← links)
- A hybrid second-order method for homogenous polynomial optimization over unit sphere (Q2014677) (← links)
