Sciweavers

9 search results - page 1 / 2
» A quasi-Newton algorithm for nonconvex, nonsmooth optimizati...
Sort
View
JMLR
2010
143views more  JMLR 2010»
13 years 7 months ago
A Quasi-Newton Approach to Nonsmooth Convex Optimization Problems in Machine Learning
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...
Jin Yu, S. V. N. Vishwanathan, Simon Günter, ...
JOTA
2011
149views more  JOTA 2011»
13 years 4 months ago
Globally Convergent Cutting Plane Method for Nonconvex Nonsmooth Minimization
: Nowadays, solving nonsmooth (not necessarily differentiable) optimization problems plays a very important role in many areas of industrial applications. Most of the algorithms d...
Napsu Karmitsa, Mario Tanaka Filho, José He...
JMIV
2007
83views more  JMIV 2007»
13 years 9 months ago
Minimization of a Detail-Preserving Regularization Functional for Impulse Noise Removal
Recently, a powerful two-phase method for restoring images corrupted with high level impulse noise has been developed. The main drawback of the method is the computational efficie...
Jian-Feng Cai, Raymond H. Chan, Carmine Di Fiore
ICML
2007
IEEE
14 years 10 months ago
Scalable training of L1-regularized log-linear models
The l-bfgs limited-memory quasi-Newton method is the algorithm of choice for optimizing the parameters of large-scale log-linear models with L2 regularization, but it cannot be us...
Galen Andrew, Jianfeng Gao
TSP
2008
106views more  TSP 2008»
13 years 9 months ago
Guaranteeing Practical Convergence in Algorithms for Sensor and Source Localization
This paper considers localization of a source or a sensor from distance measurements. We argue that linear algorithms proposed for this purpose are susceptible to poor noise perfor...
Baris Fidan, Soura Dasgupta, Brian D. O. Anderson