An algorithm to find a maximum of a multilinear map over a product of spheres
From MaRDI portal
Publication:1935752
DOI10.1016/J.JAT.2012.09.007zbMATH Open1267.65067arXiv1110.6217OpenAlexW1972162367MaRDI QIDQ1935752FDOQ1935752
Authors: César Massri 
Publication date: 19 February 2013
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Abstract: We provide an algorithm to compute the 2-norm maximum of a multilinear map over a product of spheres. As a corollary we give a method to compute the first singular value of a linear map and an application to the theory of entangled states in quantum physics. Also, we give an application to find the closest rank-one tensor of a given one.
Full work available at URL: https://arxiv.org/abs/1110.6217
Recommendations
- Finite algorithm for minimizing the product of two linear functions over a polyhedron
- Algorithm for maximizing a linear function on the set of integral points of a convex polyhedron
- An algorithm for finding the global maximum of a multimodal, multivariate function
- scientific article; zbMATH DE number 1530342
- Maximization of homogeneous polynomials over the simplex and the sphere: structure, stability, and generic behavior
- The Douglas-Rachford algorithm for the case of the sphere and the line
- Multilinear spherical maximal function
- Approximation by multivariate sublinear and max-product operators
- An algorithm for linearizing convex extremal problems
- An algorithm for nonlinear programs over Cartesian product sets
Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Cited In (3)
This page was built for publication: An algorithm to find a maximum of a multilinear map over a product of spheres
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1935752)
