Nuclear norm minimization for the planted clique and biclique problems. - Brendan P. W. Ames; Stephen A. Vavasis (Math. Program., 2011)

Convex relaxation for the planted clique, biclique, and clustering problems. - Brendan P. W. Ames (2011)

Guaranteed clustering and biclustering via semidefinite programming. - Brendan P. W. Ames (Math. Program., 2014)

Convex optimization for the planted k-disjoint-clique problem. - Brendan P. W. Ames; Stephen A. Vavasis (Math. Program., 2014)

A Leapfrog Strategy for Pursuit-Evasion in a Polygonal Environment. - Brendan P. W. Ames; Andrew Beveridge; Rosalie Carlson; Claire Djang; Volkan Isler; Stephen Ragain; Maxray Savage (Int. J. Comput. Geom. Appl., 2015)

Guaranteed Recovery of Planted Cliques and Dense Subgraphs by Convex Relaxation. - Brendan P. W. Ames (J. Optim. Theory Appl., 2015)

Alternating direction method of multipliers for penalized zero-variance discriminant analysis. - Brendan P. W. Ames; Mingyi Hong 001 (Comput. Optim. Appl., 2016)

Exact Clustering of Weighted Graphs via Semidefinite Programming. - Aleksis Pirinen; Brendan P. W. Ames (J. Mach. Learn. Res., 2019)

Convex Optimization for the Densest Subgraph and Densest Submatrix Problems. - Polina Bombina; Brendan P. W. Ames (Oper. Res. Forum, 2020)

Proximal methods for sparse optimal scoring and discriminant analysis. - Summer Atkins; Gudmundur Einarsson; Line Harder Clemmensen; Brendan P. W. Ames (Adv. Data Anal. Classif., 2023)