Sciweavers

1182 search results - page 48 / 237
» Iterative Methods in Combinatorial Optimization
Sort
View
CONSTRAINTS
2006
115views more  CONSTRAINTS 2006»
15 years 1 months ago
A Cost-Regular Based Hybrid Column Generation Approach
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...
Sophie Demassey, Gilles Pesant, Louis-Martin Rouss...
CORR
2010
Springer
103views Education» more  CORR 2010»
15 years 2 months ago
On the Finite Time Convergence of Cyclic Coordinate Descent Methods
Cyclic coordinate descent is a classic optimization method that has witnessed a resurgence of interest in machine learning. Reasons for this include its simplicity, speed and stab...
Ankan Saha, Ambuj Tewari
ICCS
2007
Springer
15 years 5 months ago
Efficient Implementation of an Optimal Interpolator for Large Spatial Data Sets
Abstract. Interpolating scattered data points is a problem of wide ranging interest. One of the most popular interpolation methods in geostatistics is ordinary kriging. The price f...
Nargess Memarsadeghi, David M. Mount
EOR
2008
103views more  EOR 2008»
15 years 2 months ago
New complexity analysis of IIPMs for linear optimization based on a specific self-regular function
Primal-dual Interior-Point Methods (IPMs) have shown their ability in solving large classes of optimization problems efficiently. Feasible IPMs require a strictly feasible startin...
Maziar Salahi, M. Reza Peyghami, Tamás Terl...
ARC
2012
Springer
317views Hardware» more  ARC 2012»
13 years 9 months ago
A High Throughput FPGA-Based Implementation of the Lanczos Method for the Symmetric Extremal Eigenvalue Problem
Iterative numerical algorithms with high memory bandwidth requirements but medium-size data sets (matrix size ∼ a few 100s) are highly appropriate for FPGA acceleration. This pap...
Abid Rafique, Nachiket Kapre, George A. Constantin...