Brendan P. W. Ames

Available identifiers

Publication	Date of Publication	Type
Proximal Methods for Sparse Optimal Scoring and Discriminant Analysis	2023-12-02	Paper
Convex optimization for the densest subgraph and densest submatrix problems	2021-02-08	Paper
Exact Clustering of Weighted Graphs via Semidefinite Programming	2019-05-02	Paper
Convex optimization for the densest subgraph and densest submatrix problems	2019-04-05	Paper
Proximal Methods for Sparse Optimal Scoring and Discriminant Analysis	2017-05-19	Paper
Alternating direction method of multipliers for penalized zero-variance discriminant analysis	2016-07-01	Paper
Guaranteed recovery of planted cliques and dense subgraphs by convex relaxation	2015-12-14	Paper
A Leapfrog Strategy for Pursuit-Evasion in a Polygonal Environment	2015-11-03	Paper
Derivatives of compound matrix valued functions	2015-09-30	Paper
Guaranteed clustering and biclustering via semidefinite programming	2014-10-17	Paper
Convex optimization for the planted \(k\)-disjoint-clique problem	2014-02-25	Paper
Alternating direction method of multipliers for penalized zero-variance discriminant analysis	2014-01-21	Paper
A new derivation of a formula by Kato	2011-12-02	Paper
Nuclear norm minimization for the planted clique and biclique problems	2011-09-27	Paper
Asymptotic expansions of the ordered spectrum of symmetric matrices	2010-04-21	Paper

This page was built for person: Brendan P. W. Ames