Sciweavers

20 search results - page 2 / 4
» jgo 2010
Sort
View
JGO
2010
69views more  JGO 2010»
13 years 3 months ago
Partitioning procedure for polynomial optimization
Polyxeni-Margarita Kleniati, Panos Parpas, Ber&cce...
JGO
2010
61views more  JGO 2010»
12 years 11 months ago
A new smoothing Newton-type algorithm for semi-infinite programming
Chen Ling, Qin Ni, Liqun Qi, Soon-Yi Wu
JGO
2010
531views more  JGO 2010»
13 years 3 months ago
Characterizing zero-derivative points
We study smooth functions in several variables with a Lipschitz derivative. It is shown that these functions have the “envelope property”: Around zero-derivative points, and on...
Sanjo Zlobec
JGO
2010
115views more  JGO 2010»
13 years 3 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
89views more  JGO 2010»
13 years 3 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