A feasibility approach for constructing combinatorial designs of circulant type
From MaRDI portal
Publication:1752612
DOI10.1007/s10878-018-0250-5zbMath1417.90123arXiv1711.02502OpenAlexW2767507940MaRDI QIDQ1752612
Francisco J. Aragón Artacho, Rubén Campoy, Matthew K. Tam, Ilias S. Kotsireas
Publication date: 24 May 2018
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1711.02502
Douglas-Rachford algorithmcirculant weighing matricescirculant combinatorial designsStrassler's table
Related Items
The Douglas-Rachford algorithm for convex and nonconvex feasibility problems, Geometric search for Hadamard matrices, Group invariant weighing matrices, SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem
- Recent results on Douglas-Rachford methods for combinatorial optimization problems
- Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
- Circulant weighing matrices
- Convex analysis and nonlinear optimization. Theory and examples.
- Circulant weighing matrices of weight \(2^{2t}\)
- Determination of all possible orders of weight 16 circulant weighing matrices
- Solving graph coloring problems with the Douglas-Rachford algorithm
- Group invariant weighing matrices
- Quantum algorithms for weighing matrices and quadratic residues
- Compression of periodic complementary sequences and applications
- Hadamard ideals and Hadamard matrices with two circulant cores
- Determinantenabschätzungen für binäre Matrizen. (Estimation of determinants for binary matrices)
- Finding D-optimal designs by randomised decomposition and switching
- New Results on D-Optimal Matrices
- DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS
- D-Optimal Matrices of Orders 118, 138, 150, 154 and 174
- Gröbner Bases, Coding, and Cryptography
- Weighing matrices and optical quantum computing
- Decomposition through formalization in a product space
- Combinatorial Designs
- Self-dual codes over F/sub p/ and weighing matrices
- Orthogonal Designs
- On Determinants with Elements ±1, II
- Searching with iterated maps
- On the Finite Convergence of the Douglas--Rachford Algorithm for Solving (Not Necessarily Convex) Feasibility Problems in Euclidean Spaces
- Convex analysis and monotone operator theory in Hilbert spaces
- Algorithms in invariant theory
