33 search results - page 6 / 7 » A local convergence property of primal-dual methods for nonl... |
GECCO
2005
Springer
13 years 11 months ago
2005
Springer
Generalized geometric programming (GGP) is an optimization method in which the objective function and constraints are nonconvex functions. Thus, a GGP problem includes multiple lo...
SIAMAM
2008
13 years 6 months ago
2008
We consider the problem of calculating resonance frequencies and radiative losses of an optical resonator. The optical resonator is in the form of a thin membrane with variable die...
CVPR
2012
IEEE
11 years 8 months ago
2012
IEEE
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random field (MRF) framework. Many methods have been developed over the y...
BMEI
2008
IEEE
14 years 23 days ago
2008
IEEE
Standard Gene Expression Programming(GEP) works with fixed rate of mutation and crossover, ignoring the variation of the individual fitness, hence it works in the local optimum st...
ICCV
1999
IEEE
14 years 8 months ago
1999
IEEE
The use of human hand as a natural interface device serves as a motivating force for research in the modeling, analyzing and capturing of the motion of articulated hand. Model-bas...