Sciweavers

14548 search results - page 8 / 2910
» The Optimal Path-Matching Problem
Sort
View
MOC
2002
101views more  MOC 2002»
14 years 11 months ago
Global and uniform convergence of subspace correction methods for some convex optimization problems
This paper gives some global and uniform convergence estimates for a class of subspace correction (based on space decomposition) iterative methods applied to some unconstrained con...
Xue-Cheng Tai, Jinchao Xu
MOR
2010
91views more  MOR 2010»
14 years 9 months ago
On the One-Dimensional Optimal Switching Problem
We explicitly solve the optimal switching problem for one-dimensional diffusions by directly employing the dynamic programming principle and the excessive characterization of the ...
Erhan Bayraktar, Masahiko Egami
TASLP
2010
78views more  TASLP 2010»
14 years 6 months ago
Solving Demodulation as an Optimization Problem
We introduce two new methods for the demodulation of acoustic signals by posing the problem in a convex optimization framework. This allows the parameters of the modulator and carr...
Gregory Sell, Malcolm Slaney
JGO
2010
96views more  JGO 2010»
14 years 9 months ago
Duality and optimality conditions for generalized equilibrium problems involving DC functions
We consider a generalized equilibrium problem involving DC functions which is called (GEP). For this problem we establish two new dual formulations based on Toland-Fenchel-Lagrange...
N. Dinh, Jean-Jacques Strodiot, Van Hien Nguyen
IJAIT
2010
167views more  IJAIT 2010»
14 years 9 months ago
Bee Colony Optimization with Local Search for Traveling Salesman Problem
Many real world industrial applications involve finding a Hamiltonian path with minimum cost. Some instances that belong to this category are transportation routing problem, scan c...
Li-Pei Wong, Malcolm Yoke-Hean Low, Chin Soon Chon...