213 search results - page 2 / 43 » Adaptive memory programming for constrained global optimizat... |
CP
2006
Springer
13 years 9 months ago
2006
Springer
We consider probabilistic constrained linear programs with general distributions for the uncertain parameters. These problems generally involve non-convex feasible sets. We develo...
MP
2006
13 years 5 months ago
2006
Abstract. Interval analysis is a powerful tool which allows to design branch-and-bound algorithms able to solve many global optimization problems. In this paper we present new adap...
ANOR
2002
13 years 5 months ago
2002
A new algorithm for solving smooth large-scale minimization problems with bound constraints is introduced. The way of dealing with active constraints is similar to the one used in...
JACIII
2000
13 years 5 months ago
2000
MP
2011
13 years 17 days 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...