The following pages link to GloptiPoly (Q16522):
Displaying 50 items.
- A heuristic for nonlinear global optimization (Q120012) (← links)
- Nonsmooth bundle trust-region algorithm with applications to robust stability (Q255187) (← links)
- Advances in computational Lyapunov analysis using sum-of-squares programming (Q258390) (← links)
- 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)
- Book review of: J.-B. Lasserre, An introduction to polynomial and semi-algebraic optimization (Q321039) (← links)
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- A novel LMI-based optimization algorithm for the guaranteed estimation of the domain of attraction using rational Lyapunov functions (Q357969) (← 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)
- POS3POLY -- a MATLAB preprocessor for optimization with positive polynomials (Q402198) (← links)
- Optimality conditions and finite convergence of Lasserre's hierarchy (Q403636) (← links)
- Copositivity and constrained fractional quadratic problems (Q403649) (← links)
- Globally optimal algorithms for stratified autocalibration (Q408824) (← links)
- An efficient DC programming approach for portfolio decision with higher moments (Q409263) (← links)
- Global optimization of polynomials restricted to a smooth variety using sums of squares (Q412217) (← links)
- Linear control of time-domain constrained systems (Q445871) (← links)
- On the synthesis of linear \(H_\infty\) filters for polynomial systems (Q450688) (← 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)
- On the structure of generalized plant convexifying static \(H_\infty\) control problems (Q458880) (← links)
- Design of Marx generators as a structured eigenvalue assignment (Q472612) (← links)
- A sufficient condition of Euclidean rings given by polynomial optimization over a box (Q478924) (← links)
- The \(\mathcal A\)-truncated \(K\)-moment problem (Q486690) (← links)
- A certificate for semidefinite relaxations in computing positive-dimensional real radical ideals (Q492020) (← links)
- Three dimensional strongly symmetric circulant tensors (Q492775) (← 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 nonlinear semidefinite optimization relaxation for the worst-case linear optimization under uncertainties (Q494344) (← 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)
- 2D system analysis via dual problems and polynomial matrix inequalities (Q501511) (← links)
- Lebesgue decomposition in action via semidefinite relaxations (Q503483) (← 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)
- The domain of attraction for the endemic equilibrium of an SIRS epidemic model (Q551467) (← links)
- Robust synchronization analysis in nonlinear stochastic cellular networks with time-varying delays, intracellular perturbations and intercellular noise (Q554481) (← links)
- Semidefinite relaxations of dynamical programs under discrete constraints (Q601981) (← links)
- Partitioning procedure for polynomial optimization (Q604960) (← links)
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints (Q607501) (← links)
- Polyhedral and semidefinite programming methods in combinatorial optimization (Q611309) (← links)
- Necessary global optimality conditions for nonlinear programming problems with polynomial constraints (Q623367) (← links)
- Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm (Q625645) (← links)
- Semidefinite representation of convex hulls of rational varieties (Q637512) (← links)
- Comonotone and coconvex rational interpolation and approximation (Q639347) (← 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)
