نتایج جستجو برای: multivariate optimization
تعداد نتایج: 432974 فیلتر نتایج به سال:
The Taguchi method is a useful technique to improve the performance of products or processes at a lower cost and in less time. This procedure can be categorized in the static and dynamic quality characteristics. The optimization of multiple responses has received increasing attention over the last few years in many manufacturing organizations. Several approaches dealing with multiple static q...
One attractive candidate as standard risk metric is Conditional Value at Risk (CVaR), which has a lot of advantages compared with Value at Risk (VaR). In this paper, I study CVaR as an objective function in a series of optimization problems. I compare the CPU time of the linear programming approach proposed in [14] with that of the fast gradient descent method [5] when increasing the number of ...
The paper deals with unconstrained global minimization of rational functions. A necessary condition is given for the function to have a nite innmum. In case the condition is satissed, the problem is shown to be equivalent to a speciic constrained polynomial optimization problem. In this paper, we solve a relaxation of the latter formulation using semi-deenite programming. In general, the relaxa...
Statistical designs and response surface techniques for the optimization of chromatographic systems.
This paper describes fundamentals and applications of multivariate statistical techniques for the optimization of chromatographic systems. The surface response methodologies: central composite design, Doehlert matrix and Box-Behnken design are discussed and applications of these techniques for optimization of sample preparation steps (extractions) and determination of experimental conditions fo...
We consider branch and bound methods for enclosing all unconstrained global minimizers of a nonconvex nonlinear twice-continuously differentiable objective function. In particular, we consider bounds obtained with interval arithmetic, with the “midpoint test,” but no acceleration procedures. Unless the lower bound is exact, the algorithm without acceleration procedures in general gives an undes...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید