Geometric search for Hadamard matrices

DOI10.1016/j.tcs.2019.01.025zbMath1422.68273OpenAlexW2912527174MaRDI QIDQ2420569

Jeffery Kline

Publication date: 6 June 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2019.01.025

zbMATH Keywords

matrix completionnonconvex optimizationHadamard matrixD-optimal designsrandomized local search

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Combinatorics in computer science (68R05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20) Boolean and Hadamard matrices (15B34)

Uses Software

• SciPy

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Symmetric Hadamard matrices of order 116 and 172 exist
• Heuristic algorithms for Hadamard matrices with two circulant cores
• On the asymptotic existence of Hadamard matrices
• On the existence of Hadamard matrices
• A feasibility approach for constructing combinatorial designs of circulant type
• Williamson matrices of order \(4n\) for \(n = 33, 35, 39\)
• General lower bounds on maximal determinants of binary matrices
• Hadamard's determinant theorem and the sum of four squares
• Superconcentration and Related Topics
• DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS
• $(1,-1)$-Matrices with Near-Extremal Properties
• On Orthogonal Matrices
• A new construction for Hadamard matrices
• A Hadamard matrix of order 428