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

DOI10.1007/S11590-019-01498-7MaRDI QIDQ2228375zbMATH OpenOpenAlexFDO

Authors Xiaoli Cen, Yong Xia

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 programmingpolynomial optimizationsum of squaresbranch-and-bound

Mathematics Subject Classification ID

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

Recommendations

• A linear-time algorithm for globally maximizing the sum of a generalized Rayleigh quotient and a quadratic form on the unit sphere
• Sum of squares methods for minimizing polynomial forms over spheres and hypersurfaces
• Maximization of a positive definite quadratic form on a polyhedron
• Minimizing a quadratic over a sphere
• Maximization of sums of quotients of quadratic forms and some generalizations
• Publication:3030587
• On the local maxima of a constrained quadratic form
• Global optimality of quadratic minimization over symmetric polytopes
• The accumulated distribution of quadratic forms on the sphere

Cites work

• scientific article; zbMATH DE number 4213315 (Why is no real title available?)
• A hybrid second-order method for homogenous polynomial optimization over unit sphere
• A linear-time algorithm for globally maximizing the sum of a generalized Rayleigh quotient and a quadratic form on the unit sphere
• A sequential subspace projection method for extreme Z-eigenvalues of supersymmetric tensors.
• Alternating direction method of multipliers for real and complex polynomial optimization models
• An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming
• An algorithm for nonconvex programming problems
• Approximation Methods for Polynomial Optimization
• BARON: A general purpose global optimization software package
• Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
• Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start
• Generalized normal forms and polynomial system solving
• Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement
• GloptiPoly 3: moments, optimization and semidefinite programming
• Introduction to global optimization.
• Nonnegative Polynomial Optimization over Unit Spheres and Convex Programming Relaxations
• On local convexity of quadratic transformations
• On the best rank-1 approximation of higher-order supersymmetric tensors
• On the exhaustivity of simplicial partitioning
• On the minimum number of simplex shapes in longest edge bisection refinement of a regular \(n\)-simplex
• Semidefinite relaxations for best rank-1 tensor approximations
• Simplicial global optimization
• Subdivision methods for solving polynomial equations
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones

Cited in

(2)

• Maximizing the sum of a generalized Rayleigh quotient and another Rayleigh quotient on the unit sphere via semidefinite programming
• A linear-time algorithm for globally maximizing the sum of a generalized Rayleigh quotient and a quadratic form on the unit sphere

Describes a project that uses

Uses Software

• BARON
• SeDuMi
• GloptiPoly

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2228375)