Sciweavers

3049 search results - page 28 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
MP
2007
102views more  MP 2007»
13 years 7 months ago
Elastic-mode algorithms for mathematical programs with equilibrium constraints: global convergence and stationarity properties
The elastic-mode formulation of the problem of minimizing a nonlinear function subject to equilibrium constraints has appealing local properties in that, for a finite value of the...
Mihai Anitescu, Paul Tseng, Stephen J. Wright
AAAI
2011
12 years 7 months ago
Dual Decomposition for Marginal Inference
We present a dual decomposition approach to the treereweighted belief propagation objective. Each tree in the tree-reweighted bound yields one subproblem, which can be solved with...
Justin Domke
FOCM
2011
175views more  FOCM 2011»
13 years 2 months ago
Convergence of Fixed-Point Continuation Algorithms for Matrix Rank Minimization
The matrix rank minimization problem has applications in many fields such as system identification, optimal control, low-dimensional embedding etc. As this problem is NP-hard in ...
Donald Goldfarb, Shiqian Ma
3DIM
2005
IEEE
14 years 1 months ago
Globally Convergent Range Image Registration by Graph Kernel Algorithm
Automatic range image registration without any knowledge of the viewpoint requires identification of common regions across different range images and then establishing point corr...
Radim Sára, Ikuko Shimizu Okatani, Akihiro ...
GECCO
2006
Springer
121views Optimization» more  GECCO 2006»
13 years 11 months ago
A splicing/decomposable encoding and its novel operators for genetic algorithms
In this paper, we introduce a new genetic representation -- a splicing/decomposable (S/D) binary encoding, which was proposed based on some theoretical guidance and existing recom...
Yong Liang, Kwong-Sak Leung, Kin-Hong Lee