Brendan P. W. Ames

According to our database, Brendan P. W. Ames authored at least 10 papers between 2011 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Proximal methods for sparse optimal scoring and discriminant analysis.

Summer Atkins, Gudmundur Einarsson, Line Harder Clemmensen, Brendan P. W. Ames

Adv. Data Anal. Classif., December, 2023

2020

Convex Optimization for the Densest Subgraph and Densest Submatrix Problems.

Polina Bombina, Brendan P. W. Ames

Oper. Res. Forum, 2020

2019

Exact Clustering of Weighted Graphs via Semidefinite Programming.

Aleksis Pirinen, Brendan P. W. Ames

J. Mach. Learn. Res., 2019

2016

Alternating direction method of multipliers for penalized zero-variance discriminant analysis.

Brendan P. W. Ames, Mingyi Hong

Comput. Optim. Appl., 2016

2015

Guaranteed Recovery of Planted Cliques and Dense Subgraphs by Convex Relaxation.

Brendan P. W. Ames

J. Optim. Theory Appl., 2015

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

2014

Convex optimization for the planted k-disjoint-clique problem.

Brendan P. W. Ames, Stephen A. Vavasis

Math. Program., 2014

Guaranteed clustering and biclustering via semidefinite programming.

Brendan P. W. Ames

Math. Program., 2014

2011

Convex relaxation for the planted clique, biclique, and clustering problems.

Brendan P. W. Ames

PhD thesis, 2011

Nuclear norm minimization for the planted clique and biclique problems.

Brendan P. W. Ames, Stephen A. Vavasis

Math. Program., 2011