Globally maximizing the sum of squares of quadratic forms over the unit sphere
From MaRDI portal
Publication:2228375
DOI10.1007/S11590-019-01498-7zbMATH Open1459.90147OpenAlexW2983978896MaRDI QIDQ2228375FDOQ2228375
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
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
Quadratic programming (90C20) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Polynomial optimization (90C23)
Cites Work
- BARON: A general purpose global optimization software package
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Title not available (Why is that?)
- On the best rank-1 approximation of higher-order supersymmetric tensors
- GloptiPoly 3: moments, optimization and semidefinite programming
- Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
- Generalized normal forms and polynomial system solving
- Introduction to global optimization.
- An algorithm for nonconvex programming problems
- Nonnegative Polynomial Optimization over Unit Spheres and Convex Programming Relaxations
- Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start
- Semidefinite relaxations for best rank-1 tensor approximations
- Subdivision methods for solving polynomial equations
- Approximation Methods for Polynomial Optimization
- On local convexity of quadratic transformations
- Simplicial global optimization
- On the minimum number of simplex shapes in longest edge bisection refinement of a regular \(n\)-simplex
- Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement
- An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming
- A sequential subspace projection method for extreme Z-eigenvalues of supersymmetric tensors.
- Alternating direction method of multipliers for real and complex polynomial optimization models
- On the exhaustivity of simplicial partitioning
- 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
Cited In (2)
Uses Software
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)
