Matrix product constraints by projection methods
From MaRDI portal
Publication:1675556
DOI10.1007/s10898-016-0466-9zbMath1408.90240arXiv1601.01003OpenAlexW2222233352MaRDI QIDQ1675556
Publication date: 2 November 2017
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1601.01003
Related Items (7)
An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix ⋮ Projections onto hyperbolas or bilinear constraint sets in Hilbert spaces ⋮ Comparing Averaged Relaxed Cutters and Projection Methods: Theory and Examples ⋮ A simplex algorithm for rational cp-factorization ⋮ Multi-target detection with application to cryo-electron microscopy ⋮ Benchmark Problems for Phase Retrieval ⋮ SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD
Cites Work
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem
- Heuristics for exact nonnegative matrix factorization
- On the nonnegative rank of distance matrices
- Recent results on Douglas-Rachford methods for combinatorial optimization problems
- Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
- The maximal \(\{-1,1\}\)-determinant of order 15
- Factoring polynomials with rational coefficients
- On the geometric interpretation of the nonnegative rank
- A Concise Guide to Complex Hadamard Matrices
- New Lower Bounds and Asymptotics for the cp-Rank
- On the Complexity of Nonnegative Matrix Factorization
- Fast quantizing and decoding and algorithms for lattice quantizers and codes
- The Complexity of Bit Retrieval
- Unnamed Item
This page was built for publication: Matrix product constraints by projection methods
