Sciweavers

1177 search results - page 14 / 236
» Iterative methods for Robbins problems
Sort
View
3DIM
2001
IEEE
13 years 11 months ago
A Nearest Neighbor Method for Efficient ICP
A novel solution is presented to the Nearest Neighbor Problem that is specifically tailored for determining correspondences within the Iterative Closest Point Algorithm. The refer...
Michael A. Greenspan, Guy Godin
ICASSP
2010
IEEE
13 years 7 months ago
Iterated smoothing for accelerated gradient convex minimization in signal processing
In this paper, we consider the problem of minimizing a non-smooth convex problem using first-order methods. The number of iterations required to guarantee a certain accuracy for ...
Tobias Lindstrøm Jensen, Jan Østerga...
ANOR
2008
171views more  ANOR 2008»
13 years 7 months ago
A branch and bound method for the job-shop problem with sequence-dependent setup times
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
Christian Artigues, Dominique Feillet
SIAMMAX
2010
156views more  SIAMMAX 2010»
13 years 2 months ago
Preconditioned Conjugate Gradient Method for Optimal Control Problems with Control and State Constraints
Optimality systems and their linearizations arising in optimal control of partial differential equations with pointwise control and (regularized) state constraints are considered. ...
Roland Herzog, Ekkehard W. Sachs
INFORMS
2008
62views more  INFORMS 2008»
13 years 7 months ago
A Stochastic Approximation Method to Compute Bid Prices in Network Revenue Management Problems
We present a stochastic approximation method to compute bid prices in network revenue management problems. The key idea is to visualize the total expected revenue as a function of...
Huseyin Topaloglu