Showing 1 - 10 of 115
This paper advocates the use of methods based on global approximation models for optimization problems with time-consuming function evaluations and integer variables.We show that methods based on local approximations may lead to the integer rounding of the optimal solution of the continuous...
Persistent link: https://www.econbiz.de/10012734174
In the area of computer simulation, Latin hypercube designs play an important role. In this paper the classes of maximin and Audze-Eglais Latin hypercube designs are considered. Up to now only several two-dimensional designs and a few higher dimensional designs for these classes have been...
Persistent link: https://www.econbiz.de/10012727125
Persistent link: https://www.econbiz.de/10006439844
Persistent link: https://www.econbiz.de/10010056081
In this paper we prove the counterintuitive result that the quadratic least squares approximation of a multivariate convex function in a finite set of points is not necessarily convex, even though it is convex for a univariate convex function. This result has many consequences both for the field...
Persistent link: https://www.econbiz.de/10011090460
Polynomials, trigonometric polynomials, and rational functions are widely used for the discrete approximation of functions or simulation models.Often, it is known beforehand, that the underlying unknown function has certain properties, e.g. nonnegative or increasing on a certain region.However,...
Persistent link: https://www.econbiz.de/10011090673
AMS classifications: 65D05; 65K05; 90C22;
Persistent link: https://www.econbiz.de/10011091008
We review complexity results for minimizing polynomials over the standard simplex and unit hypercube.In addition, we show that there exists a polynomial time approximation scheme (PTAS) for minimizing Lipschitz continuous functions and functions with uniformly bounded Hessians over the standard...
Persistent link: https://www.econbiz.de/10011091363
Semidefinite programming (SDP) may be seen as a generalization of linear programming (LP). In particular, one may extend interior point algorithms for LP to SDP, but it has proven much more difficult to exploit structure in the SDP data during computation. We survey three types of special...
Persistent link: https://www.econbiz.de/10008483192
We review complexity results for minimizing polynomials over the standard simplex and unit hypercube. In addition, we derive new results on the computational complexity of approximating the minimum of some classes of functions (including Lipschitz continuous functions) on the standard simplex....
Persistent link: https://www.econbiz.de/10005240872