Pages that link to "Item:Q5390033"
From MaRDI portal
The following pages link to Approximation Methods for Polynomial Optimization (Q5390033):
Displaying 26 items.
- Approximation algorithms for discrete polynomial optimization (Q384206) (← links)
- Approximation bounds for trilinear and biquadratic optimization problems over nonconvex constraints (Q481050) (← links)
- On cones of nonnegative quartic forms (Q525602) (← links)
- Approximation algorithms for optimization of real-valued general conjugate complex forms (Q683722) (← links)
- Optimal switching between cash-flow streams (Q684138) (← links)
- Approximation algorithms for nonnegative polynomial optimization problems over unit spheres (Q721466) (← links)
- Approximation methods for complex polynomial optimization (Q742305) (← links)
- A robust unscented transformation for uncertain moments (Q1738657) (← links)
- Penalized semidefinite programming for quadratically-constrained quadratic optimization (Q2022173) (← links)
- Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space (Q2079694) (← links)
- On norm compression inequalities for partitioned block tensors (Q2174201) (← links)
- Globally maximizing the sum of squares of quadratic forms over the unit sphere (Q2228375) (← links)
- Rounding on the standard simplex: regular grids for global optimization (Q2250080) (← links)
- On the tensor spectral \(p\)-norm and its dual norm via partitions (Q2307701) (← links)
- The 2013 Newton Institute Programme on polynomial optimization (Q2349128) (← links)
- Characterizing real-valued multivariate complex polynomials and their symmetric tensor representations (Q2797107) (← links)
- Bounds on the spectral norm and the nuclear norm of a tensor based on tensor partitions (Q2827070) (← links)
- Genericity in Polynomial Optimization (Q2967821) (← links)
- On New Classes of Nonnegative Symmetric Tensors (Q2968174) (← links)
- Control analysis and design via randomised coordinate polynomial minimisation (Q5027405) (← links)
- On the Consistent Path Problem (Q5144803) (← links)
- Alternating direction method of multipliers for real and complex polynomial optimization models (Q5169464) (← links)
- Probability Bounds for Polynomial Functions in Random Variables (Q5244874) (← links)
- Logical Approaches to Computational Barriers (Q5898834) (← links)
- Jacobi-type algorithms for homogeneous polynomial optimization on Stiefel manifolds with applications to tensor approximations (Q6045329) (← links)
- Approximating Tensor Norms via Sphere Covering: Bridging the Gap between Primal and Dual (Q6176424) (← links)
