Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Brendan Ames
Observed names:
Ames, Brendan,
Brendan P Ames,
Brendan P. W. Ames,
Brendan P.W. Ames
Institutions:
University of Alabama,
University of Southampton
Observed institutions:
California Institute of Technology,
University of Minnesota,
University of Waterloo,
University of Alabama,
University of Southampton
ORCID:
0000-0003-0810-7956
Observed ORCID:
0000-0003-0810-7956
OpenAlex ID:
A5000908908
Nuclear norm minimization for the planted clique and biclique problems
2011
·
Brendan P. W. Ames
, Stephen A. Vavasis
·
Mathematical Programming
·
112
PDF
Solving ptychography with a convex relaxation
2015
·
Roarke Horstmeyer
, Richard Y Chen
, et al.
·
New Journal of Physics
·
97
PDF
Guaranteed clustering and biclustering via semidefinite programming
2013
·
Brendan P. W. Ames
·
Mathematical Programming
·
59
PDF
Convex optimization for the planted k-disjoint-clique problem
2013
·
Brendan P. W. Ames
, Stephen A. Vavasis
·
Mathematical Programming
·
50
PDF
Alternating direction method of multipliers for penalized zero-variance discriminant analysis
2016
·
Brendan P. W. Ames
, Mingyi Hong
·
Computational Optimization and Applications
·
32
PDF
Guaranteed Recovery of Planted Cliques and Dense Subgraphs by Convex Relaxation
2015
·
Brendan P. W. Ames
·
Journal of Optimization Theory and Applications
·
21
PDF
A Leapfrog Strategy for Pursuit-Evasion in a Polygonal Environment
2015
·
Brendan Ames
, Andrew Beveridge
, et al.
·
International Journal of Computational Geometry & Applications
·
12
PDF
Robust convex relaxation for the planted clique and densest k-subgraph problems
2013
·
Brendan Ames
·
arXiv (Cornell University)
·
12
Classification of visual comprehension based on EEG data using sparse optimal scoring
2021
·
Linda K Ford
, Joshua D Borneman
, et al.
·
Journal of Neural Engineering
·
11
Proximal methods for sparse optimal scoring and discriminant analysis
2022
·
Summer Atkins
, Gudmundur Einarsson
, et al.
·
Advances in Data Analysis and Classification
·
10
PDF
Convex Optimization for the Densest Subgraph and Densest Submatrix Problems
2020
·
Polina Bombina
, Brendan Ames
·
Operations Research Forum
·
7
PDF
Derivatives of compound matrix valued functions
2015
·
Brendan P.W. Ames
, Hristo S. Sendov
·
Journal of Mathematical Analysis and Applications
·
7
PDF
Alternating direction method of multipliers for sparse zero-variance discriminant analysis and principal component analysis
2014
·
Brendan Ames
, Mingyi Hong
·
4
Convex relaxation for the planted clique, biclique, and clustering problems
2011
·
Brendan Ames
·
UWSpace (University of Waterloo)
·
3
PDF
Asymptotic expansions of the ordered spectrum of symmetric matrices
2010
·
Brendan P.W. Ames
, Hristo S. Sendov
·
Nonlinear Analysis
·
3
A new derivation of a formula by Kato
2011
·
Brendan P.W. Ames
, Hristo S. Sendov
·
Linear Algebra and its Applications
·
2
PDF
accSDA: Accelerated Sparse Discriminant Analysis
2017
·
Gudmundur Einarsson
, Line Clemmensen
, et al.
·
1
PDF
Clustering of Sparse and Approximately Sparse Graphs by Semidefinite Programming
2016
·
Aleksis Pirinen
, Brendan Ames
·
arXiv (Cornell University)
·
1
Contrastive Neural Embeddings Reveal Individual Traits Beyond Conversational Role
2026
·
Huang, Hubert
, McCleod, Michelle
, et al.
·
ePrints Soton (University of Southampton)
PDF
Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming
2026
·
Olanubi, Valentine
, Agar, Phineas
, et al.
·
ePrints Soton (University of Southampton)
PDF
Dyadic Neural Dynamics: Extending Representation Learning to Social Neuroscience
2025
·
Glushanina, Maria
, Huang, Jeffrey
, et al.
·
arXiv (Cornell University)
PDF
Show more works
View as search
Works count:
21
Citation count:
444
H-index:
10
I10-index:
10
Year
Topic
Type
