3049 search results - page 237 / 610 » On the Convergence of Bound Optimization Algorithms |
156
click to vote
JGTOOLS
2007
15 years 6 months ago
2007
Relief mapping using the secant method offers an efficient method for adding per pixel height field based displacement to an arbitrary polygonal mesh in real time. The technique...
174
click to vote
ISNN
2005
Springer
16 years 1 days ago
2005
Springer
Recently, a mathematical proof is obtained in (Liu, Chiu, Xu, 2004) on the so called one-bit-matching conjecture that all the sources can be separated as long as there is an one-to...
169
click to vote
SIAMJO
2010
15 years 5 months ago
2010
Abstract. We present a new “lifting” approach for the solution of nonlinear optimization problems (NLPs) that have objective and constraint functions with intermediate variable...
215
click to vote
SIAMIS
2010
15 years 1 months ago
2010
Simulated annealing (SA) and deterministic continuation are well-known generic approaches to global optimization. Deterministic continuation is computationally attractive but produ...
181
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
— This paper addresses model reduction for a Markov chain on a large state space. A simulation-based framework is introduced to perform state aggregation of the Markov chain base...