SPOTless
From MaRDI portal
Software:40848
No author found.
Related Items (69)
Some applications of polynomial optimization in operations research and real-time decision making ⋮ Maximum feasible subsystems of distance geometry constraints ⋮ Second-order cone programming relaxations for a class of multiobjective convex polynomial problems ⋮ Hyperbolic Relaxation of $k$-Locally Positive Semidefinite Matrices ⋮ Nonnegative Polynomials and Circuit Polynomials ⋮ A bounded degree SOS hierarchy for polynomial optimization ⋮ Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem ⋮ Robust estimations of the region of attraction using invariant sets ⋮ A new approximation hierarchy for polynomial conic optimization ⋮ Distance geometry and data science ⋮ Rejoinder on: ``Distance geometry and data science ⋮ On the Construction of Converging Hierarchies for Polynomial Optimization Based on Certificates of Global Positivity ⋮ Decompositions of Semidefinite Matrices and the Perspective Reformulation of Nonseparable Quadratic Programs ⋮ Augmented finite transition systems as abstractions for control synthesis ⋮ Stability analysis and control of a class of LPV systems with piecewise constant parameters ⋮ Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization ⋮ Region of attraction analysis of nonlinear stochastic systems using polynomial chaos expansion ⋮ Sum of squares basis pursuit with linear and second order cone programming ⋮ Bounding extrema over global attractors using polynomial optimisation ⋮ Polynomial Norms ⋮ The Convex Hull of a Quadratic Constraint over a Polytope ⋮ DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization ⋮ Sum of squares approach for nonlinear \(\operatorname{H}_\infty\) control ⋮ Sum-of-Squares Optimization without Semidefinite Programming ⋮ A globally asymptotically stable polynomial vector field with rational coefficients and no local polynomial Lyapunov function ⋮ Bounds on mean energy in the Kuramoto–Sivashinsky equation computed using semidefinite programming ⋮ Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 ⋮ A note on convex relaxations for the inverse eigenvalue problem ⋮ A multilevel analysis of the Lasserre hierarchy ⋮ TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity ⋮ Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension ⋮ Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables ⋮ A robust unscented transformation for uncertain moments ⋮ On sums of squares of \(K\)-nomials ⋮ A Lagrange Multiplier Expression Method for Bilevel Polynomial Optimization ⋮ DC decomposition of nonconvex polynomials with algebraic techniques ⋮ Optimization over structured subsets of positive semidefinite matrices via column generation ⋮ A multiple-comparison-systems method for distributed stability analysis of large-scale nonlinear systems ⋮ Real zeros of SONC polynomials ⋮ Safe nonlinear control design for input constrained polynomial systems using sum-of-squares programming ⋮ Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods ⋮ A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs ⋮ Penalized semidefinite programming for quadratically-constrained quadratic optimization ⋮ A survey on conic relaxations of optimal power flow problem ⋮ Validating numerical semidefinite programming solvers for polynomial invariants ⋮ Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone ⋮ Polyhedral approximations of the semidefinite cone and their application ⋮ A moment and sum-of-squares extension of dual dynamic programming with application to nonlinear energy storage problems ⋮ Alternative SDP and SOCP approximations for polynomial optimization ⋮ Mathematical programming formulations for the alternating current optimal power flow problem ⋮ Mathematical programming formulations for the alternating current optimal power flow problem ⋮ Finding Extremal Periodic Orbits with Polynomial Optimization, with Application to a Nine-Mode Model of Shear Flow ⋮ On polyhedral and second-order cone decompositions of semidefinite optimization problems ⋮ Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation ⋮ Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices ⋮ Stability analysis and output-feedback synthesis of hybrid systems affected by piecewise constant parameters via dynamic resetting scalings ⋮ Limitations on the Expressive Power of Convex Cones without Long Chains of Faces ⋮ Bounding Extreme Events in Nonlinear Dynamics Using Convex Optimization ⋮ Newton polytopes and relative entropy optimization ⋮ A sublevel moment-SOS hierarchy for polynomial optimization ⋮ Decomposed structured subsets for semidefinite and sum-of-squares optimization ⋮ Diagonally Dominant Programming in Distance Geometry ⋮ Finding unstable periodic orbits: a hybrid approach with polynomial optimization ⋮ Approximations of Countably Infinite Linear Programs over Bounded Measure Spaces ⋮ A unified framework of SAGE and SONC polynomials and its duality theory ⋮ Synthesizing Robust Domains of Attraction for State-Constrained Perturbed Polynomial Systems ⋮ Passivity and passivity indices of nonlinear systems under operational limitations using approximations ⋮ On Polyhedral Approximations of the Positive Semidefinite Cone ⋮ Sparse PSD approximation of the PSD cone
This page was built for software: SPOTless
