Pages that link to "Item:Q2706355"

The following pages link to Global optimization with polynomials and the problem of moments (Q2706355):

Displaying 50 items.

• The truncated moment problem via homogenization and flat extensions (Q452366) (← links)
• Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts (Q453612) (← links)
• Robust control of uncertain systems: classical results and recent developments (Q458745) (← links)
• Lower bounds on the global minimum of a polynomial (Q461443) (← links)
• A Frank-Wolfe type theorem for nondegenerate polynomial programs (Q463745) (← links)
• A probabilistic symbolic algorithm to find the minimum of a polynomial function on a basic closed semialgebraic set (Q464735) (← links)
• Establishing robust stability of discrete-time systems with time-varying uncertainty: the Gram-SOS approach (Q473299) (← links)
• Separating inequalities for nonnegative polynomials that are not sums of squares (Q480684) (← links)
• On polynomial optimization over non-compact semi-algebraic sets (Q481041) (← links)
• The \(\mathcal A\)-truncated \(K\)-moment problem (Q486690) (← links)
• On local convexity of quadratic transformations (Q489135) (← links)
• Proving inequalities and solving global optimization problems via simplified CAD projection (Q492036) (← links)
• Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods (Q494329) (← links)
• A generalization of Löwner-John's ellipsoid theorem (Q494343) (← links)
• A reliable affine relaxation method for global optimization (Q496103) (← links)
• Analysis of copositive optimization based linear programming bounds on standard quadratic optimization (Q496589) (← links)
• Global optimality conditions and optimization methods for polynomial programming problems (Q496629) (← links)
• 2D system analysis via dual problems and polynomial matrix inequalities (Q501511) (← links)
• Exactness criteria for SDP-relaxations of quadratic extremum problems (Q508574) (← links)
• Semidefinite approximations of conical hulls of measured sets (Q512256) (← links)
• Branch and bound algorithm with applications to robust stability (Q513164) (← 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)
• Simple approximations of semialgebraic sets and their applications to control (Q518297) (← links)
• A robust Lagrangian-DNN method for a class of quadratic optimization problems (Q523570) (← links)
• The domain of attraction for the endemic equilibrium of an SIRS epidemic model (Q551467) (← links)
• Semidefinite relaxations of dynamical programs under discrete constraints (Q601981) (← links)
• Lower bounds for a polynomial in terms of its coefficients (Q604214) (← links)
• Partitioning procedure for polynomial optimization (Q604960) (← links)
• On the Kalman-Yakubovich-Popov lemma and the multidimensional models (Q607391) (← links)
• Approximation algorithms for homogeneous polynomial optimization with quadratic constraints (Q607501) (← links)
• A facial reduction algorithm for finding sparse SOS representations (Q613325) (← links)
• Necessary global optimality conditions for nonlinear programming problems with polynomial constraints (Q623367) (← links)
• A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming (Q623727) (← links)
• Closures of quadratic modules (Q636039) (← links)
• Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems (Q644908) (← links)
• On the complexity of computing the handicap of a sufficient matrix (Q644911) (← links)
• Enforcing stability constraints in set-membership identification of linear dynamic systems (Q646450) (← 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)
• First order conditions for semidefinite representations of convex sets defined by rational or singular polynomials (Q662299) (← links)
• Further results on Cauchy tensors and Hankel tensors (Q668898) (← links)
• Cross-Hill: a heuristic method for global optimization (Q669439) (← links)
• Approximation algorithms for optimization of real-valued general conjugate complex forms (Q683722) (← links)
• Optimal switching between cash-flow streams (Q684138) (← links)
• Norm bounds and underestimators for unconstrained polynomial integer minimization (Q684153) (← links)
• Sum of squares methods for minimizing polynomial forms over spheres and hypersurfaces (Q693193) (← links)
• A polynomial optimization approach to constant rebalanced portfolio selection (Q694522) (← links)
• Convex relaxations for mixed integer predictive control (Q710707) (← links)