124 search results - page 14 / 25 » Optimality Conditions via Exact Penalty Functions |
108
Voted
SIAMJO
2010
14 years 10 months ago
2010
Abstract. Sequential quadratic programming (SQP) methods form a class of highly efficient algorithms for solving nonlinearly constrained optimization problems. Although second deri...
114
Voted
ML
2002
ACM
14 years 11 months ago
2002
ACM
We examine linear program (LP) approaches to boosting and demonstrate their efficient solution using LPBoost, a column generation based simplex method. We formulate the problem as...
109
click to vote
JMLR
2010
14 years 10 months ago
2010
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...
148
click to vote
CVPR
2011
IEEE
14 years 8 months ago
2011
IEEE
A label consistent K-SVD (LC-KSVD) algorithm to learn a discriminative dictionary for sparse coding is presented. In addition to using class labels of training data, we also assoc...
94
Voted
CVPR
2012
IEEE
13 years 2 months ago
2012
IEEE
We present an iterative approximate solution to the multidimensional assignment problem under general cost functions. The method maintains a feasible solution at every step, and i...