Sciweavers

178 search results - page 26 / 36
» LSMR: An iterative algorithm for sparse least-squares proble...
Sort
View
CEC
2009
IEEE
14 years 2 months ago
A clustering multi-objective evolutionary algorithm based on orthogonal and uniform design
Abstract— Designing efficient algorithms for difficult multiobjective optimization problems is a very challenging problem. In this paper a new clustering multi-objective evolut...
Yuping Wang, Chuangyin Dang, Hecheng Li, Lixia Han...
SIAMJO
2000
74views more  SIAMJO 2000»
13 years 7 months ago
A Specialized Interior-Point Algorithm for Multicommodity Network Flows
Abstract. Despite the efficiency shown by interior-point methods in large-scale linear programming, they usually perform poorly when applied to multicommodity flow problems. The ne...
Jordi Castro
ICIP
2009
IEEE
14 years 8 months ago
A Generic Variational Approach For Demosaicking From An Arbitrary Color Filter Array
We propose a method to demosaick images acquired with a completely arbitrary color filter array (CFA). We adopt a variational approach where the reconstructed image has maximal sm...
SIAMJO
2008
93views more  SIAMJO 2008»
13 years 7 months ago
Smooth Optimization with Approximate Gradient
We show that the optimal complexity of Nesterov's smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded er...
Alexandre d'Aspremont
SIAMSC
2011
151views more  SIAMSC 2011»
13 years 2 months ago
Inexact Newton Methods with Restricted Additive Schwarz Based Nonlinear Elimination for Problems with High Local Nonlinearity
The classical inexact Newton algorithm is an efficient and popular technique for solving large sparse nonlinear system of equations. When the nonlinearities in the system are wellb...
Xiao-Chuan Cai, Xuefeng Li