scientific article; zbMATH DE number 2068056

zbMath1165.90592MaRDI QIDQ4464661

Leonid Faybusovich

Publication date: 27 May 2004

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items (13)

Maximization of homogeneous polynomials over the simplex and the sphere: structure, stability, and generic behavior ⋮ On the complexity of optimization over the standard simplex ⋮ A Survey of Semidefinite Programming Approaches to the Generalized Problem of Moments and Their Error Analysis ⋮ Handelman's hierarchy for the maximum stable set problem ⋮ Two methods for the maximization of homogeneous polynomials over the simplex ⋮ The complexity of optimizing over a simplex, hypercube or sphere: a short survey ⋮ On the convergence rate of grid search for polynomial optimization over the simplex ⋮ Rounding on the standard simplex: regular grids for global optimization ⋮ Sum of squares methods for minimizing polynomial forms over spheres and hypersurfaces ⋮ A PTAS for the minimization of polynomials of fixed degree over the simplex ⋮ Approximating the existential theory of the reals ⋮ Approximating the existential theory of the reals ⋮ On an extension of Pólya's Positivstellensatz

This page was built for publication: