Sciweavers

867 search results - page 10 / 174
» Optimization Method RasID-GA for Numerical Constrained Optim...
Sort
View
ICIP
2010
IEEE
13 years 4 months ago
Gradient projection for linearly constrained convex optimization in sparse signal recovery
The 2- 1 compressed sensing minimization problem can be solved efficiently by gradient projection. In imaging applications, the signal of interest corresponds to nonnegative pixel...
Zachary T. Harmany, Daniel Thompson, Rebecca Wille...
JGO
2010
121views more  JGO 2010»
13 years 5 months ago
The oracle penalty method
A new and universal penalty method is introduced in this contribution. It is especially intended to be applied in stochastic metaheuristics like genetic algorithms, particle swarm...
Martin Schlüter, Matthias Gerdts
CEC
2009
IEEE
14 years 1 months ago
Multi-objective optimization using self-adaptive differential evolution algorithm
- In this paper, we propose a Multiobjective Self-adaptive Differential Evolution algorithm with objective-wise learning strategies (OW-MOSaDE) to solve numerical optimization pr...
Vicky Ling Huang, Shuguang Z. Zhao, Rammohan Malli...
JOTA
2010
127views more  JOTA 2010»
13 years 1 months ago
Optimization Over the Efficient Set of Multi-objective Convex Optimal Control Problems
We consider multi-objective convex optimal control problems. First we state a relationship between the (weakly or properly) efficient set of the multi-objective problem and the sol...
Henri Bonnel, C. Yalçin Kaya
FAW
2008
Springer
127views Algorithms» more  FAW 2008»
13 years 8 months ago
Visiting a Polygon on the Optimal Way to a Query Point
Abstract. We study a constrained version of the shortest path problem in polygonal domains, in which the path must visit a given target polygon. We provide an efficient algorithm f...
Ramtin Khosravi, Mohammad Ghodsi