Lower bounds for cubic optimization over the sphere

DOI10.1007/s10957-021-01809-yzbMath1469.90110OpenAlexW3120652591MaRDI QIDQ2031942

Orlando Sarmiento, Márcia H. C. Fampa, Christoph Buchheim

Publication date: 15 June 2021

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-021-01809-y

zbMATH Keywords

global optimizationtrust region subproblemdual boundcubic optimization problem

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Uses Software

• GloptiPoly

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
• Handbook on semidefinite, conic and polynomial optimization
• Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
• Sum of squares methods for minimizing polynomial forms over spheres and hypersurfaces
• Introduction to sensitivity and stability analysis in nonlinear programming
• A semidefinite programming approach to the generalized problem of moments
• Global Optimization with Polynomials and the Problem of Moments
• Rank-One Approximation to High Order Tensors
• An Exact Algorithm for Nonconvex Quadratic Integer Minimization Using Ellipsoidal Relaxations
• The cubic spherical optimization problems
• Maximum Block Improvement and Polynomial Optimization
• Semidefinite Relaxations for Best Rank-1 Tensor Approximations
• GloptiPoly 3: moments, optimization and semidefinite programming
• Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
• Convergence of a block coordinate descent method for nondifferentiable minimization

This page was built for publication: Lower bounds for cubic optimization over the sphere