The following pages link to Brendan P. W. Ames (Q301681):
Displaying 15 items.
- Proximal Methods for Sparse Optimal Scoring and Discriminant Analysis (Q97534) (← links)
- Alternating direction method of multipliers for penalized zero-variance discriminant analysis (Q97537) (← links)
- Convex optimization for the densest subgraph and densest submatrix problems (Q142862) (← links)
- (Q463739) (redirect page) (← links)
- Guaranteed clustering and biclustering via semidefinite programming (Q463740) (← links)
- (Q499224) (redirect page) (← links)
- Derivatives of compound matrix valued functions (Q499225) (← links)
- A new derivation of a formula by Kato (Q649571) (← links)
- Nuclear norm minimization for the planted clique and biclique problems (Q717132) (← links)
- Guaranteed recovery of planted cliques and dense subgraphs by convex relaxation (Q896191) (← links)
- Asymptotic expansions of the ordered spectrum of symmetric matrices (Q965040) (← links)
- (Q2226480) (redirect page) (← links)
- Convex optimization for the planted \(k\)-disjoint-clique problem (Q2436653) (← links)
- A Leapfrog Strategy for Pursuit-Evasion in a Polygonal Environment (Q3449119) (← links)
- Exact Clustering of Weighted Graphs via Semidefinite Programming (Q4633040) (← links)
