Pages that link to "Item:Q2706355"
From MaRDI portal
The following pages link to Global optimization with polynomials and the problem of moments (Q2706355):
Displaying 50 items.
- Stability and robustness analysis of nonlinear systems via contraction metrics and SOS programming (Q2440818) (← links)
- Atomic optimization. I: Search space transformation and one-dimensional problems (Q2441253) (← links)
- Semidefinite relaxations for semi-infinite polynomial programming (Q2450900) (← links)
- Bi-criteria and approximation algorithms for restricted matchings (Q2453169) (← links)
- Efficiency improvement in an \(n\)D systems approach to polynomial optimization (Q2457407) (← links)
- An alternative approach for nonlinear optimal control problems based on the method of moments (Q2457954) (← links)
- Numerical multilinear algebra and its applications (Q2477577) (← links)
- Global optimization for sum of generalized fractional functions (Q2479363) (← links)
- Global minimization of rational functions and the nearest GCDs (Q2481368) (← links)
- Stability of polytopes of matrices via affine parameter-dependent Lyapunov functions: asymptotically exact LMI conditions (Q2484239) (← links)
- Global optimization of rational functions: a semidefinite programming approach (Q2490324) (← links)
- Uniform stabilization of discrete-time switched and Markovian jump linear systems (Q2491903) (← links)
- Minimizing polynomials via sum of squares over the gradient ideal (Q2492680) (← links)
- Matrix sum-of-squares relaxations for robust semi-definite programs (Q2492689) (← links)
- Robust global optimization with polynomials (Q2492692) (← links)
- Bounds on linear PDEs via semidefinite optimization (Q2494516) (← links)
- On Hermitian polynomial optimization (Q2502311) (← links)
- Establishing stability and instability of matrix hypercubes (Q2504535) (← links)
- LMI conditions for robust stability analysis based on polynomially parameter-dependent Lyapunov functions (Q2504629) (← links)
- LMIs for constrained polynomial interpolation with application in trajectory planning (Q2504686) (← links)
- Complete solutions and extremality criteria to polynomial optimization problems (Q2505557) (← links)
- A semidefinite programming based polyhedral cut and price approach for the maxcut problem (Q2506169) (← links)
- LMI relaxations in robust control (Q2512026) (← links)
- Semidefinite programming relaxations and algebraic optimization in control (Q2512289) (← links)
- Cuts for mixed 0-1 conic programming (Q2571004) (← links)
- Extrema of a real polynomial (Q2574103) (← links)
- Polyhedra related to integer-convex polynomial systems (Q2583123) (← links)
- Copositivity cuts for improving SDP bounds on the clique number (Q2638373) (← links)
- Globally optimal estimates for geometric reconstruction problems (Q2642729) (← links)
- An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs (Q2643148) (← links)
- A conversion of an SDP having free variables into the standard form SDP (Q2643612) (← links)
- A note on the stability number of an orthogonality graph (Q2643845) (← links)
- Solving polynomial least squares problems via semidefinite programming relaxations (Q2655337) (← links)
- A note on the Lasserre hierarchy for different formulations of the maximum independent set problem (Q2661585) (← links)
- Converging outer approximations to global attractors using semidefinite programming (Q2665706) (← links)
- Semidefinite relaxation method for polynomial optimization with second-order cone complementarity constraints (Q2673375) (← links)
- Least-squares solutions to polynomial systems of equations with quantum annealing (Q2677531) (← links)
- Convergence of an SDP hierarchy and optimality of robust convex polynomial optimization problems (Q2678586) (← links)
- On the equivalence of two post-quantum cryptographic families (Q2687966) (← links)
- Strengthened SDP relaxation for an extended trust region subproblem with an application to optimal power flow (Q2689820) (← links)
- Convex generalized Nash equilibrium problems and polynomial optimization (Q2693649) (← links)
- Finite-dimensional completion for the matrix-valued truncated complex moment problem (Q2693764) (← links)
- An effective version of Schmüdgen's Positivstellensatz for the hypercube (Q2693779) (← links)
- Loss functions for finite sets (Q2696910) (← links)
- A matrix nonconvex relaxation approach to unconstrained binary polynomial programs (Q2696928) (← links)
- Polynomials nonnegative on a grid and discrete optimization (Q2759070) (← links)
- The CP-matrix approximation problem (Q2790067) (← links)
- Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems (Q2796798) (← links)
- Deniable Functional Encryption (Q2798776) (← links)
- Introduction to Semidefinite, Conic and Polynomial Optimization (Q2802517) (← links)
