393 search results - page 14 / 79 » Convex Programming Methods for Global Optimization |
CORR
2010
Springer
13 years 4 months ago
2010
Springer
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...
MP
2011
13 years 2 months ago
2011
Abstract: We propose a first-order interior-point method for linearly constrained smooth optimization that unifies and extends first-order affine-scaling method and replicator d...
CVPR
2010
IEEE
13 years 9 months ago
2010
IEEE
Multiple surface searching with only image intensity information is a difficult job in the presence of high noise and weak edges. We present in this paper a novel method for global...
DATE
2010
IEEE
14 years 18 days ago
2010
IEEE
— A new sub-space max-monomial modeling scheme for CMOS transistors in sub-micron technologies is proposed to improve the modeling accuracy. Major electrical parameters of CMOS...
MOR
2006
13 years 7 months ago
2006
We apply the method known as simulated annealing to the following problem in convex optimization: minimize a linear function over an arbitrary convex set, where the convex set is ...