Globally maximizing the sum of squares of quadratic forms over the unit sphere

DOI10.1007/s11590-019-01498-7zbMath1459.90147OpenAlexW2983978896MaRDI QIDQ2228375

Yong Xia, Xiaoli Cen

Publication date: 17 February 2021

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-019-01498-7

zbMATH Keywords

quadratic programmingbranch-and-boundpolynomial optimizationsum of squares

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Quadratic programming (90C20) Polynomial optimization (90C23)

Uses Software

• BARON
• SeDuMi
• GloptiPoly

Cites Work

• Unnamed Item
• Unnamed Item
• On local convexity of quadratic transformations
• Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement
• Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
• Subdivision methods for solving polynomial equations
• BARON: A general purpose global optimization software package
• A hybrid second-order method for homogenous polynomial optimization over unit sphere
• On the exhaustivity of simplicial partitioning
• An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming
• On the Best Rank-1 Approximation of Higher-Order Supersymmetric Tensors
• Simplicial Global Optimization
• Semidefinite Relaxations for Best Rank-1 Tensor Approximations
• A sequential subspace projection method for extreme Z-eigenvalues of supersymmetric tensors
• GloptiPoly 3: moments, optimization and semidefinite programming
• Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start
• An algorithm for nonconvex programming problems
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• Nonnegative Polynomial Optimization over Unit Spheres and Convex Programming Relaxations
• Alternating direction method of multipliers for real and complex polynomial optimization models
• A Linear-Time Algorithm for Globally Maximizing the Sum of a Generalized Rayleigh Quotient and a Quadratic Form on the Unit Sphere
• Generalized normal forms and polynomial system solving
• Approximation Methods for Polynomial Optimization
• Introduction to global optimization.

This page was built for publication: Globally maximizing the sum of squares of quadratic forms over the unit sphere