Sciweavers

4 search results - page 1 / 1
» A doubly stabilized bundle method for nonsmooth convex optim...
Sort
View
MP
2007
89views more  MP 2007»
13 years 4 months ago
Globally convergent limited memory bundle method for large-scale nonsmooth optimization
Many practical optimization problems involve nonsmooth (that is, not necessarily differentiable) functions of thousands of variables. In the paper [Haarala, Miettinen, M¨akel¨a,...
Napsu Haarala, Kaisa Miettinen, Marko M. Mäke...
JOTA
2011
149views more  JOTA 2011»
12 years 11 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...
JMLR
2010
143views more  JMLR 2010»
13 years 3 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, ...
SIAMJO
2002
92views more  SIAMJO 2002»
13 years 4 months ago
Generalized Bundle Methods
We study a class of generalized bundle methods for which the stabilizing term can be any closed convex function satisfying certain properties. This setting covers several algorithm...
Antonio Frangioni