Approximation Methods for Polynomial Optimization
From MaRDI portal
Recommendations
- Approximation methods for complex polynomial optimization
- Logical Approaches to Computational Barriers
- An approximate approach of global optimization for polynomial programming problems
- Polynomial optimization, sums of squares, and applications
- Approximation algorithms for discrete polynomial optimization
- scientific article; zbMATH DE number 617915
- Polynomial approximations for continuous linear programs
- Polynomial approximation technique for dynamic optimization problems
- Extremal polynomials and methods of optimization of numerical algorithms
Cited in
(32)- A robust unscented transformation for uncertain moments
- Penalized semidefinite programming for quadratically-constrained quadratic optimization
- Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space
- On norm compression inequalities for partitioned block tensors
- Globally maximizing the sum of squares of quadratic forms over the unit sphere
- Rounding on the standard simplex: regular grids for global optimization
- On the tensor spectral p-norm and its dual norm via partitions
- The 2013 Newton Institute Programme on polynomial optimization
- Characterizing real-valued multivariate complex polynomials and their symmetric tensor representations
- Bounds on the spectral norm and the nuclear norm of a tensor based on tensor partitions
- Words from the guest editors
- Genericity in polynomial optimization
- On new classes of nonnegative symmetric tensors
- Approximation algorithms for discrete polynomial optimization
- Approximation bounds for trilinear and biquadratic optimization problems over nonconvex constraints
- Control analysis and design via randomised coordinate polynomial minimisation
- Sparse Polynomial Optimization
- On the consistent path problem
- Alternating direction method of multipliers for real and complex polynomial optimization models
- Probability bounds for polynomial functions in random variables
- On cones of nonnegative quartic forms
- scientific article; zbMATH DE number 2190135 (Why is no real title available?)
- Inhomogeneous polynomial optimization over a convex set: an approximation approach
- Logical Approaches to Computational Barriers
- Jacobi-type algorithms for homogeneous polynomial optimization on Stiefel manifolds with applications to tensor approximations
- Moment and Polynomial Optimization
- Approximating Tensor Norms via Sphere Covering: Bridging the Gap between Primal and Dual
- Approximation algorithms for optimization of real-valued general conjugate complex forms
- Optimal switching between cash-flow streams
- Approximation algorithms for nonnegative polynomial optimization problems over unit spheres
- On approximation algorithms for commutative quaternion polynomial optimization
- Approximation methods for complex polynomial optimization
This page was built for publication: Approximation Methods for Polynomial Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5390033)
