Showing 2026Show all
2 papers · 1 filter
math.OC2026
Order-2 Tightness of Block-Sparse SOS Relaxations for One-Layer ReLU Network Verification with a Matching Input-Sharing Graph
Godai Azuma, Sunyoung Kim, Makoto Yamashita
Azuma, Kim, and Yamashita formulated the verification problem for one-layer ReLU networks as a quadratically constrained quadratic program and established tight semidefinite relaxa…
math.OC2026
Tight Conic Relaxations for Rank-one Doubly Nonnegative Matrix Completion
Godai Azuma, Sunyoung Kim, Makoto Yamashita
We study tight conic relaxations for a quadratically constrained quadratic programming (QCQP) formulation of rank-one doubly nonnegative (DNN) matrix completion. Motivated by spars…