SPOTless

swMATH29134MaRDI QIDQ40848FDOQ40848

Author name not available (Why is that?)

Cited In (69)

• Bounding extrema over global attractors using polynomial optimisation
• Nonnegative Polynomials and Circuit Polynomials
• Bounding extreme events in nonlinear dynamics using convex optimization
• A Lagrange multiplier expression method for bilevel polynomial optimization
• Passivity and passivity indices of nonlinear systems under operational limitations using approximations
• Hyperbolic Relaxation of $k$-Locally Positive Semidefinite Matrices
• Region of attraction analysis of nonlinear stochastic systems using polynomial chaos expansion
• Stability analysis and control of a class of LPV systems with piecewise constant parameters
• Approximations of Countably Infinite Linear Programs over Bounded Measure Spaces
• A globally asymptotically stable polynomial vector field with rational coefficients and no local polynomial Lyapunov function
• Real zeros of SONC polynomials
• Some applications of polynomial optimization in operations research and real-time decision making
• A multilevel analysis of the Lasserre hierarchy
• Sparse PSD approximation of the PSD cone
• A note on convex relaxations for the inverse eigenvalue problem
• Limitations on the Expressive Power of Convex Cones without Long Chains of Faces
• Polyhedral approximations of the semidefinite cone and their application
• On the construction of converging hierarchies for polynomial optimization based on certificates of global positivity
• Diagonally dominant programming in distance geometry
• A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs
• Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods
• Robust estimations of the region of attraction using invariant sets
• Augmented finite transition systems as abstractions for control synthesis
• The convex hull of a quadratic constraint over a polytope
• DC decomposition of nonconvex polynomials with algebraic techniques
• Maximum feasible subsystems of distance geometry constraints
• Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017
• Alternative SDP and SOCP approximations for polynomial optimization
• Lasserre hierarchy for large scale polynomial optimization in real and complex variables
• TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
• A robust unscented transformation for uncertain moments
• Penalized semidefinite programming for quadratically-constrained quadratic optimization
• A survey on conic relaxations of optimal power flow problem
• Distance geometry and data science
• On polyhedral and second-order cone decompositions of semidefinite optimization problems
• Decompositions of semidefinite matrices and the perspective reformulation of nonseparable quadratic programs
• Sum-of-squares optimization without semidefinite programming
• Second-order cone programming relaxations for a class of multiobjective convex polynomial problems
• DSOS and SDSOS optimization: more tractable alternatives to sum of squares and semidefinite optimization
• Stability analysis and output-feedback synthesis of hybrid systems affected by piecewise constant parameters via dynamic resetting scalings
• A moment and sum-of-squares extension of dual dynamic programming with application to nonlinear energy storage problems
• Bounds on mean energy in the Kuramoto–Sivashinsky equation computed using semidefinite programming
• On polyhedral approximations of the positive semidefinite cone
• Synthesizing robust domains of attraction for state-constrained perturbed polynomial systems
• Optimization over structured subsets of positive semidefinite matrices via column generation
• A bounded degree SOS hierarchy for polynomial optimization
• Chordal-TSSOS: a moment-SOS hierarchy that exploits term sparsity with chordal extension
• Newton polytopes and relative entropy optimization
• Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem
• A sublevel moment-SOS hierarchy for polynomial optimization
• Sum of squares basis pursuit with linear and second order cone programming
• Mathematical programming formulations for the alternating current optimal power flow problem
• Mathematical programming formulations for the alternating current optimal power flow problem
• Validating numerical semidefinite programming solvers for polynomial invariants
• A new approximation hierarchy for polynomial conic optimization
• Polynomial norms
• Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation
• Decomposed structured subsets for semidefinite and sum-of-squares optimization
• Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices
• Safe nonlinear control design for input constrained polynomial systems using sum-of-squares programming
• Finding extremal periodic orbits with polynomial optimization, with application to a nine-mode model of shear flow
• Rejoinder on: ``Distance geometry and data science
• Finding unstable periodic orbits: a hybrid approach with polynomial optimization
• Sum of squares approach for nonlinear \(\operatorname{H}_\infty\) control
• A multiple-comparison-systems method for distributed stability analysis of large-scale nonlinear systems
• Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
• On sums of squares of \(K\)-nomials
• Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization
• A unified framework of SAGE and SONC polynomials and its duality theory

This page was built for software: SPOTless