Brendan P. W. Ames - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 9 from 9

2023

Proximal methods for sparse optimal scoring and discriminant analysisSummer Atkins, Gudmundur Einarsson, Line Harder Clemmensen, Brendan P. W. Ames. adac, 17(4):983-1036, December 2023. [doi]

2020

Convex Optimization for the Densest Subgraph and Densest Submatrix ProblemsPolina Bombina, Brendan P. W. Ames. orf, 1(3), 2020. [doi]

2016

Alternating direction method of multipliers for penalized zero-variance discriminant analysisBrendan P. W. Ames, Mingyi Hong. coap, 64(3):725-754, 2016. [doi]

2015

Guaranteed Recovery of Planted Cliques and Dense Subgraphs by Convex RelaxationBrendan P. W. Ames. jota, 167(2):653-675, 2015. [doi]

A Leapfrog Strategy for Pursuit-Evasion in a Polygonal EnvironmentBrendan P. W. Ames, Andrew Beveridge, Rosalie Carlson, Claire Djang, Volkan Isler, Stephen Ragain, Maxray Savage. ijcga, 25(2):77-100, 2015. [doi]

2014

Convex optimization for the planted k-disjoint-clique problemBrendan P. W. Ames, Stephen A. Vavasis. mp, 143(1-2):299-337, 2014. [doi]

Guaranteed clustering and biclustering via semidefinite programmingBrendan P. W. Ames. mp, 147(1-2):429-465, 2014. [doi]

2011

Nuclear norm minimization for the planted clique and biclique problemsBrendan P. W. Ames, Stephen A. Vavasis. mp, 129(1):69-89, 2011. [doi]

Convex relaxation for the planted clique, biclique, and clustering problemsBrendan P. W. Ames. PhD thesis, University of Waterloo, Ontario, Canada, 2011. [doi]

Sign in or sign up to see more results.

runs on WebDSL