Pages that link to "Item:Q3793944"
From MaRDI portal
The following pages link to Class of global minimum bounds of polynomial functions (Q3793944):
Displaying 50 items.
- A dynamic inequality generation scheme for polynomial programming (Q263184) (← links)
- On N. Z. Shor's three scientific ideas (Q380646) (← links)
- Robust control of uncertain systems: classical results and recent developments (Q458745) (← links)
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints (Q513160) (← links)
- Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization (Q522270) (← links)
- Norm bounds and underestimators for unconstrained polynomial integer minimization (Q684153) (← links)
- A convex polynomial that is not sos-convex (Q715094) (← links)
- Signomial and polynomial optimization via relative entropy and partial dualization (Q823883) (← links)
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem (Q868442) (← links)
- Border basis relaxation for polynomial optimization (Q898268) (← links)
- Exploiting equalities in polynomial programming (Q935230) (← links)
- Main directions in the development of informatics (Q1280975) (← links)
- Sum-of-squares rank upper bounds for matching problems (Q1631641) (← links)
- An unbounded sum-of-squares hierarchy integrality gap for a polynomially solvable problem (Q1683679) (← links)
- Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization (Q1704915) (← links)
- Sparsity in sums of squares of polynomials (Q1777218) (← links)
- Symmetry groups, semidefinite programs, and sums of squares (Q1878418) (← links)
- Some directions and results of research in mathematical programming and system analysis (Q1918737) (← links)
- Hilbert's 17th problem and best dual bounds in quadratic minimization (Q1968560) (← links)
- Newton polytopes and relative entropy optimization (Q2067684) (← links)
- Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials (Q2143214) (← links)
- Certifying the global optimality of quartic minimization over the sphere (Q2158108) (← links)
- Generating valid linear inequalities for nonlinear programs via sums of squares (Q2198537) (← links)
- Stable rank-one matrix completion is solved by the level \(2\) Lasserre relaxation (Q2231643) (← links)
- Completely positive reformulations for polynomial optimization (Q2349130) (← links)
- Univariate parameterization for global optimization of mixed-integer polynomial problems (Q2355892) (← links)
- Approximate gcds of polynomials and sparse SOS relaxations (Q2378493) (← links)
- Computing sum of squares decompositions with rational coefficients (Q2378506) (← links)
- Numerical multilinear algebra and its applications (Q2477577) (← links)
- Approximation of the joint spectral radius using sum of squares (Q2483273) (← links)
- Geometric control of hybrid systems (Q2677099) (← links)
- Relative entropy relaxations for signomial optimization (Q2805708) (← links)
- Sum-of-Squares Rank Upper Bounds for Matching Problems (Q2835696) (← links)
- Computation with Polynomial Equations and Inequalities Arising in Combinatorial Optimization (Q2897307) (← links)
- On the determination of the solutions and maximum admissible power of the load flow equation via LMIS (Q2937868) (← links)
- On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy (Q2976145) (← links)
- An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming (Q3009764) (← links)
- On the Hardest Problem Formulations for the $$0/1$$ Lasserre Hierarchy (Q3448844) (← links)
- A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem (Q3452846) (← links)
- Fault-tolerant control synthesis for a class of nonlinear systems: Sum of squares optimization approach (Q3626954) (← links)
- Bounds for Random Binary Quadratic Programs (Q4609468) (← links)
- A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem (Q4634034) (← links)
- SOS Is Not Obviously Automatizable, Even Approximately (Q4638114) (← links)
- (Q5005186) (← links)
- Control analysis and design via randomised coordinate polynomial minimisation (Q5027405) (← links)
- The Random QUBO (Q5050147) (← links)
- (Q5091238) (← links)
- Certifying Unstability of Switched Systems Using Sum of Squares Programming (Q5130926) (← links)
- Certifying Polynomial Nonnegativity via Hyperbolic Optimization (Q5208888) (← links)
- Deciding Robust Feasibility and Infeasibility Using a Set Containment Approach: An Application to Stationary Passive Gas Network Operations (Q5376454) (← links)
