Distance optimization and the extremal variety of the Grassmann variety
DOI10.1007/S10957-015-0840-7zbMATH Open1342.51010OpenAlexW2228098608MaRDI QIDQ289060FDOQ289060
John Leventides, George Petroulakis, Nicos Karcanias
Publication date: 27 May 2016
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://openaccess.city.ac.uk/id/eprint/13343/1/Distance%20Optimization%20and%20the%20Extremal%20Variety%20of%20the%20Grassmann%20variety.pdf
optimizationapproximationsprojective varietiesdistance geometry problemssums of squares and representations
General theory of distance geometry (51K05) Sums of squares and representations by other particular quadratic forms (11E25) Injectives, projectives (08B30) Approximations in PL-topology (57Q55)
Cites Work
- Computations in algebraic geometry with Macaulay 2
- Tensor Decompositions and Applications
- A connectedness theorem for projective varieties, with applications to intersections and singularities of mappings
- A generalization of the Eckart-Young-Mirsky matrix approximation theorem
- A trace inequality of John von Neumann
- Solution of the determinantal assignment problem using the Grassmann matrices
- The approximate determinantal assignment problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (2)
Uses Software
This page was built for publication: Distance optimization and the extremal variety of the Grassmann variety
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q289060)