2 citations · 6 across the 13 of their papers we have counts for
Showing math.OCShow all
3 papers · 1 filter
math.OC2026
Revisiting The PBH Test: Fast Uncontrollability Certificates via Krylov Methods
Ahmad F. Taha, Mohamad H. Kazma, Abdallah A. Albustami
This letter revisits the classical PBH test through the lens of finite-horizon reachability. By casting state transfer as a minimum energy, primal optimization problem, we show tha…
math.OC2026
Connections Between Determinantal Point Processes and Gramians in Control
Mohamad H. Kazma, Ahmad F. Taha
Determinantal point processes (DPPs) are probability models over subsets of a ground set that favor diverse selections while suppressing redundancy. That is, they tend to assign hi…
math.OC2024★ 2 cited
Multilinear Extensions in Submodular Optimization for Optimal Sensor Scheduling in Nonlinear Networks
Mohamad H. Kazma, Ahmad F. Taha
Optimal sensing nodes selection (SNS) in dynamic systems is a combinatorial optimization problem that has been thoroughly studied in the recent literature. This problem can be form…