Rounding on the standard simplex: regular grids for global optimization

DOI10.1007/s10898-013-0126-2zbMath1298.90076OpenAlexW2018836677MaRDI QIDQ2250080

Immanuel M. Bomze, E. Alper Yıldırım, Stefan Gollowitzer

Publication date: 4 July 2014

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: http://cdm21054.contentdm.oclc.org/cdm/ref/collection/IR/id/1268

zbMATH Keywords

approximationproximal pointroundingregular gridmaximin distance

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items (8)

Improved approximation results on standard quartic polynomial optimization ⋮ Approximation Properties and Tight Bounds for Constrained Mixed-Integer Optimal Control ⋮ Treatment recommendation with distributional targets ⋮ A refined error analysis for fixed-degree polynomial optimization over the simplex ⋮ On the convergence rate of grid search for polynomial optimization over the simplex ⋮ An Error Analysis for Polynomial Optimization over the Simplex Based on the Multivariate Hypergeometric Distribution ⋮ An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex ⋮ On suprema of autoconvolutions with an application to Sidon sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On determining the cover of a simplex by spheres centered at its vertices
• On the complexity of optimization over the standard simplex
• The complexity of optimizing over a simplex, hypercube or sphere: a short survey
• A simplicial branch-and-bound method for solving nonconvex all-quadratic programs
• Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
• A PTAS for the minimization of polynomials of fixed degree over the simplex
• Simplicial Global Optimization
• Sensitivity theorems in integer linear programming
• Approximation Methods for Polynomial Optimization
• Numerical methods for finding global extrema (Case of a non-uniform mesh)

This page was built for publication: Rounding on the standard simplex: regular grids for global optimization