Sciweavers

5331 search results - page 59 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
SCALESPACE
2009
Springer
15 years 4 months ago
Momentum Based Optimization Methods for Level Set Segmentation
Abstract. Segmentation of images is often posed as a variational problem. As such, it is solved by formulating an energy functional depending on a contour and other image derived t...
Gunnar Läthén, Thord Andersson, Reiner...
MOC
2010
14 years 4 months ago
Optimizing the double description method for normal surface enumeration
Abstract. Many key algorithms in 3-manifold topology involve the enumeration of normal surfaces, which is based upon the double description method for finding the vertices of a con...
Benjamin A. Burton
GECCO
2006
Springer
188views Optimization» more  GECCO 2006»
15 years 1 months ago
Dominance learning in diploid genetic algorithms for dynamic optimization problems
This paper proposes an adaptive dominance mechanism for diploidy genetic algorithms in dynamic environments. In this scheme, the genotype to phenotype mapping in each gene locus i...
Shengxiang Yang
JMLR
2010
143views more  JMLR 2010»
14 years 8 months ago
A Quasi-Newton Approach to Nonsmooth Convex Optimization Problems in Machine Learning
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...
Jin Yu, S. V. N. Vishwanathan, Simon Günter, ...
CEC
2007
IEEE
15 years 4 months ago
A novel genetic algorithm for the layout optimization problem
— In this paper we present a new algorithm for the Layout Optimization Problem: this concerns the placement of circular, weighted objects inside a circular container, the two obj...
Yichun Xu, Renbin Xiao, Martyn Amos