Sciweavers

60 search results - page 3 / 12
» A Multidimensional Bisection Method for Unconstrained Minimi...
Sort
View
INFORMS
2010
147views more  INFORMS 2010»
13 years 5 months ago
Exact Algorithms for the Quadratic Linear Ordering Problem
The quadratic linear ordering problem naturally generalizes various optimization problems, such as bipartite crossing minimization or the betweenness problem, which includes linear...
Christoph Buchheim, Angelika Wiegele, Lanbo Zheng
ICASSP
2011
IEEE
13 years 9 days ago
An augmented Lagrangian method for video restoration
This paper presents a fast algorithm for restoring video sequences. The proposed algorithm, as opposed to existing methods, does not consider video restoration as a sequence of im...
Stanley H. Chan, Ramsin Khoshabeh, Kristofor B. Gi...
ICASSP
2011
IEEE
13 years 9 days ago
Bounded gradient projection methods for sparse signal recovery
The 2- 1 sparse signal minimization problem can be solved efficiently by gradient projection. In many applications, the signal to be estimated is known to lie in some range of va...
James Hernandez, Zachary T. Harmany, Daniel Thomps...
MP
2002
165views more  MP 2002»
13 years 8 months ago
A feasible semismooth asymptotically Newton method for mixed complementarity problems
Semismooth Newton methods constitute a major research area for solving mixed complementarity problems (MCPs). Early research on semismooth Newton methods is mainly on infeasible me...
Defeng Sun, Robert S. Womersley, Houduo Qi
CPHYSICS
2006
204views more  CPHYSICS 2006»
13 years 8 months ago
Genetically controlled random search: a global optimization method for continuous multidimensional functions
A new stochastic method for locating the global minimum of a multidimensional function inside a rectangular hyperbox is presented. A sampling technique is employed that makes use ...
Ioannis G. Tsoulos, Isaac E. Lagaris