Pages that link to "Item:Q1424271"
From MaRDI portal
The following pages link to Semidefinite programming relaxations for semialgebraic problems (Q1424271):
Displaying 50 items.
- Global minimization of rational functions and the nearest GCDs (Q2481368) (← links)
- Approximation of the joint spectral radius using sum of squares (Q2483273) (← links)
- Exploiting semidefinite relaxations in constraint programming (Q2489123) (← links)
- Global optimization of rational functions: a semidefinite programming approach (Q2490324) (← links)
- Minimizing polynomials via sum of squares over the gradient ideal (Q2492680) (← links)
- Robust global optimization with polynomials (Q2492692) (← links)
- Bounds on linear PDEs via semidefinite optimization (Q2494516) (← links)
- A PTAS for the minimization of polynomials of fixed degree over the simplex (Q2503350) (← links)
- Volterra series approximation for rational nonlinear system (Q2511467) (← links)
- Semidefinite programming relaxations and algebraic optimization in control (Q2512289) (← links)
- Policy iteration in finite templates domain (Q2520672) (← links)
- Polyhedra related to integer-convex polynomial systems (Q2583123) (← links)
- An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs (Q2643148) (← links)
- Iterative LMI approach to robust static output feedback control of uncertain polynomial systems with bounded actuators (Q2662248) (← links)
- Phase portraits, Lyapunov functions, and projective geometry. Lessons learned from a differential equations class and its aftermath (Q2663653) (← links)
- Computation of the maximal invariant set of discrete-time linear systems subject to a class of non-convex constraints (Q2663960) (← links)
- Causal gain-scheduled output feedback controllers using parameter-dependent Lyapunov functions (Q2665077) (← links)
- Viability, viscosity, and storage functions in model-predictive control with terminal constraints (Q2665391) (← links)
- On the equivalence of two post-quantum cryptographic families (Q2687966) (← links)
- Finding positively invariant sets and proving exponential stability of limit cycles using sum-of-squares decompositions (Q2696114) (← links)
- Learning dynamical systems using local stability priors (Q2696118) (← links)
- Introduction to Semidefinite, Conic and Polynomial Optimization (Q2802517) (← links)
- Convex Hulls of Algebraic Sets (Q2802521) (← links)
- Positivity and Optimization: Beyond Polynomials (Q2802532) (← links)
- SDP Relaxations for Non-Commutative Polynomial Optimization (Q2802540) (← links)
- Relative entropy relaxations for signomial optimization (Q2805708) (← links)
- Perturbed sums-of-squares theorem for polynomial optimization and its applications (Q2811486) (← links)
- GpoSolver: a Matlab/C++ toolbox for global polynomial optimization (Q2815514) (← links)
- Algorithm 950: Ncpol2sdpa -- sparse semidefinite programming relaxations for polynomial optimization problems of noncommuting variables (Q2828144) (← links)
- Equivalence of sum of squares convex relaxations for quadratic distance problems (Q2847256) (← links)
- On matrix algebras associated to sum-of-squares semidefinite programs (Q2872518) (← links)
- Automatic robust convex programming (Q2885466) (← links)
- Nonnegative polynomials and sums of squares (Q2892812) (← links)
- Computation with Polynomial Equations and Inequalities Arising in Combinatorial Optimization (Q2897307) (← links)
- A modified explicit algorithm based relaxation strategy for solving semi-infinite programming problems (Q2915910) (← links)
- Finding the extreme Z-eigenvalues of tensors via a sequential semidefinite programming method (Q2936744) (← links)
- Bounding Stationary Averages of Polynomial Diffusions via Semidefinite Programming (Q2953227) (← links)
- Polynomial sum of squares in fluid dynamics: a review with a look ahead (Q2955676) (← links)
- Strong SOCP Relaxations for the Optimal Power Flow Problem (Q2957450) (← links)
- Sum of squares basis pursuit with linear and second order cone programming (Q2979646) (← links)
- Improved parameter bounds for set-membership EIV problems (Q3008831) (← links)
- An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming (Q3009764) (← links)
- Lyapunov-based exact stability analysis and synthesis for linear single-parameter dependent systems (Q3058322) (← links)
- NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials (Q3093048) (← links)
- Discriminant of symmetric matrices as a sum of squares and the orthogonal group (Q3168878) (← links)
- Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines (Q3186499) (← links)
- Quantum Bilinear Optimization (Q3187180) (← links)
- Fiber Orientation Distribution Estimation Using a Peaceman--Rachford Splitting Method (Q3188198) (← links)
- On Sum of Squares Representation of Convex Forms and Generalized Cauchy--Schwarz Inequalities (Q3295879) (← links)
- Linear Temporal Logic Satisfaction in Adversarial Environments Using Secure Control Barrier Certificates (Q3297675) (← links)
