Sciweavers

3475 search results - page 124 / 695
» Backbones in Optimization and Approximation
Sort
View
SIAMMAX
2010
113views more  SIAMMAX 2010»
15 years 1 months ago
Approximate Nullspace Iterations for KKT Systems
The aim of the paper is to provide a theoretical basis for approximate reduced SQP methods. In contrast to inexact reduced SQP methods, the forward and the adjoint problem accuraci...
Kazufumi Ito, Karl Kunisch, Volker Schulz, Ilia Gh...
WSC
2008
15 years 8 months ago
Discrete stochastic optimization using linear interpolation
We consider discrete stochastic optimization problems where the objective function can only be estimated by a simulation oracle; the oracle is defined only at the discrete points....
Honggang Wang, Bruce W. Schmeiser
IPMI
2007
Springer
16 years 7 months ago
Active Mean Fields: Solving the Mean Field Approximation in the Level Set Framework
Abstract. We describe a new approach for estimating the posterior probability of tissue labels. Conventional likelihood models are combined with a curve length prior on boundaries,...
Kilian M. Pohl, Ron Kikinis, William M. Wells III
WADS
2009
Springer
274views Algorithms» more  WADS 2009»
16 years 28 days ago
Approximating Transitive Reductions for Directed Networks
Abstract. We consider minimum equivalent digraph problem, its maximum optimization variant and some non-trivial extensions of these two types of problems motivated by biological an...
Piotr Berman, Bhaskar DasGupta, Marek Karpinski
GECCO
2009
Springer
112views Optimization» more  GECCO 2009»
16 years 27 days ago
Approximating geometric crossover in semantic space
We propose a crossover operator that works with genetic programming trees and is approximately geometric crossover in the semantic space. By defining semantic as program’s eval...
Krzysztof Krawiec, Pawel Lichocki