6 citations · 21 across the 11 of their papers we have counts for
4 papers · 1 filter
A Subspace Acceleration Method for Minimization Involving a Group Sparsity-Inducing Regularizer
Frank E. Curtis, Yutong Dai, Daniel P. Robinson
We consider the problem of minimizing an objective function that is the sum of a convex function and a group sparsity-inducing regularizer. Problems that integrate such regularizer…
Sequential Quadratic Optimization for Nonlinear Equality Constrained Stochastic Optimization
Albert Berahas, Frank E. Curtis, Daniel P. Robinson +1
Sequential quadratic optimization algorithms are proposed for solving smooth nonlinear optimization problems with equality constraints. The main focus is an algorithm proposed for…
Self-Representation Based Unsupervised Exemplar Selection in a Union of Subspaces
Chong You, Chi Li, Daniel P. Robinson +1
Finding a small set of representatives from an unlabeled dataset is a core problem in a broad range of applications such as dataset summarization and information extraction. Classi…
Is an Affine Constraint Needed for Affine Subspace Clustering?
Chong You, Chun-Guang Li, Daniel P. Robinson +1
Subspace clustering methods based on expressing each data point as a linear combination of other data points have achieved great success in computer vision applications such as mot…