We consider the cubic one-spherical optimization problem, consisting in minimizing a homogeneous cubic function over the unit sphere. We propose different lower bounds that can be computed efficiently, using decompositions of the objective function and well-known results for the corresponding quadratic problem variant.
CITATION STYLE
Buchheim, C., Fampa, M., & Sarmiento, O. (2020). Tractable Relaxations for the Cubic One-Spherical Optimization Problem. In Advances in Intelligent Systems and Computing (Vol. 991, pp. 267–276). Springer Verlag. https://doi.org/10.1007/978-3-030-21803-4_28
Mendeley helps you to discover research relevant for your work.