Sciweavers

1137 search results - page 93 / 228
» The GLOBAL optimization method revisited
Sort
View
JMLR
2010
143views more  JMLR 2010»
13 years 8 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, ...
ICDAR
2009
IEEE
14 years 4 months ago
Constant-Time Locally Optimal Adaptive Binarization
Scanned document images are nowadays becoming available in increasingly higher resolutions. Meanwhile, the variations in image quality within typical document collections increase...
Iuliu Konya Konya, Christoph Seibert, Stefan Eicke...
RC
2002
72views more  RC 2002»
13 years 9 months ago
Symbolic Preconditioning with Taylor Models: Some Examples
Deterministic global optimization with interval analysis involves - using interval enclosures for ranges of the constraints, objective, and gradient to reject infeasible regions, r...
R. Baker Kearfott, G. William Walster
GECCO
2004
Springer
105views Optimization» more  GECCO 2004»
14 years 3 months ago
Reducing the Cost of the Hybrid Evolutionary Algorithm with Image Local Response in Electronic Imaging
Abstract. The paper focuses on the efficiency of the hybrid evolutionary algorithm (HEA) for solving the global optimization problem arising in electronic imaging. The particular v...
Igor V. Maslov
IDEAS
2009
IEEE
129views Database» more  IDEAS 2009»
13 years 7 months ago
Speeding-up data-driven applications with program summaries
We consider the class of database programs and address the problem of minimizing the cost of their exchanges with the database server. This cost partly consists of query execution...
Sonia Guehis, Virginie Goasdoué-Thion, Phil...