Sciweavers

39 search results - page 5 / 8
» jgo 2008
Sort
View
JGO
2010
115views more  JGO 2010»
13 years 5 months ago
Maximum flows and minimum cuts in the plane
A continuous maximum flow problem finds the largest t such that div v = t F(x, y) is possible with a capacity constraint (v1, v2) ≤ c(x, y). The dual problem finds a minimum ...
Gilbert Strang
JGO
2010
75views more  JGO 2010»
13 years 5 months ago
Optimal control of a quasi-variational obstacle problem
We consider an optimal control where the state-control relation is given by a quasi-variational inequality, namely a generalized obstacle problem. We give an existence result for s...
Samir Adly, Maïtine Bergounioux, Mohamed Ait ...
JGO
2010
138views more  JGO 2010»
13 years 5 months ago
Continuous GRASP with a local active-set method for bound-constrained global optimization
Abstract. Global optimization seeks a minimum or maximum of a multimodal function over a discrete or continuous domain. In this paper, we propose a hybrid heuristic – based on th...
Ernesto G. Birgin, Erico M. Gozzi, Mauricio G. C. ...
JGO
2010
89views more  JGO 2010»
13 years 5 months ago
Stopping rules in k-adaptive global random search algorithms
In this paper we develop a methodology for defining stopping rules in a general class of global random search algorithms that are based on the use of statistical procedures. To bu...
Anatoly A. Zhigljavsky, Emily Hamilton
JGO
2008
90views more  JGO 2008»
13 years 7 months ago
A scaling algorithm for polynomial constraint satisfaction problems
Abstract. Good scaling is an essential requirement for the good behavior of many numerical algorithms. In particular, for problems involving multivariate polynomials, a change of s...
Ferenc Domes, Arnold Neumaier