A stochastic-gradient-based interior-point algorithm for minimizing a
co...
In this paper, we revisit the problem of local optimization in RANSAC. O...
A sequential quadratic optimization algorithm is proposed for solving sm...
Sequential quadratic optimization algorithms are proposed for solving sm...
Finding a small set of representatives from an unlabeled dataset is a co...
Subspace clustering methods based on expressing each data point as a lin...
Given an overcomplete dictionary A and a signal b = Ac^* for some sparse...
We propose a new framework for studying the exact recovery of signals wi...
Proximal based methods are well-suited to nonsmooth optimization problem...
Although momentum-based optimization methods have had a remarkable impac...
Recent methods for learning a linear subspace from data corrupted by out...
The acceleration technique first introduced by Nesterov for gradient des...
Classical results in sparse recovery guarantee the exact reconstruction ...
A method is proposed for solving equality constrained nonlinear optimiza...
Many computer vision tasks involve processing large amounts of data
cont...
State-of-the-art subspace clustering methods are based on expressing eac...
Predictive models are finding an increasing number of applications in ma...
Subspace clustering methods based on ℓ_1, ℓ_2 or nuclear norm
regulariza...