Quadratically constrained minimum cross-entropy analysis

Quadratically constrained minimum cross-entropy problem has recently been studied by Zhang and Brockett through an elaborately constructed dual. In this paper, we take a geometric programming approach to analyze this problem. Unlike Zhang and Brockett, we separate the probability constraint from general quadratic constraints and use two simple geometric inequalities to derive its dual problem. Furthermore, by using the dual perturbation method, we directly prove the strong duality theorem and derive a dual-to-primal conversion formula. As a by-product, the perturbation proof gives us insights to develop a computation procedure that avoids dual non-differentiability and allows us to use a general purpose optimizer to find an-optimal solution for the quadratically constrained minimum cross-entropy analysis.     

Convergence of interval-type algorithms for generalized fractional programming

The purpose of this paper is to analyze the convergence of interval-type algorithms for solving the generalized fractional program. They are characterized by an interval [LB _k , UB _k ] including*, and the length of the interval is reduced at each iteration. A closer analysis of the bounds LB _k and UB _k allows to modify slightly the best known interval-type algorithm NEWMODM accordingly to prove its convergence and derive convergence rates similar to those for a Dinkelbach-type algorithm MAXMODM under the same conditions. Numerical results in the linear case indicate that the modifications to get convergence results are not obtained at the expense of the numerical efficiency since the modified version BFII is as efficient as NEWMODM and more efficient than MAXMODM.This research was supported by NSERC (Grant A8312) and FCAR (Grant 0899).     

On consistency of bounding operations in deterministic global optimization

This technical comment refers to the discussion of strong consistency of several bounding procedures in Lemma 2.1 and Proposition 2.1 of Ref. 1. A necessary clarification is given of the notion of convergence _q in Lemma 2.1, and a derivation of Proposition 2.1 is presented that includes a new and simple consistency proof of the classical bounding by convex envelopes used in many branch-and-bound procedures.     

A minimum average risk approach to shrinkage estimators of the normal mean

For the problem of estimating the normal mean based on a random sample X ₁,...,X _n when a prior value ₀ is available, a class of shrinkage estimators % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-qqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xHapdbiqaaeGaciGaaiaabeqaamaabaabaaGcbaWaaubeaeqaje% aWbaGaamOBaaWcbeqdbaGafqiVd0MbaKaaaaGccaqGGaGaaiikaiaa% dUgacaGGPaGaeyypa0Jaam4AaiaacIcadaqfqaqabKqaahaacaqGUb% aaleqaneaacaqGubaaaOGaaiykaiaabccadaqfqaqabKqaahaacaWG% UbaaleqaneaaceqGybGbaebaaaGccaqGGaGaey4kaSIaaeiiaiaacI% cacaaIXaGaaeiiaiabgkHiTiaabccacaWGRbGaaiikamaavababeqc% baCaaiaab6gaaSqab0qaaiaabsfaaaGccaGGPaGaaiykamaavababe% qcbaCaaiaad6gaaSqab0qaaiabeY7aTbaaaaa!5615!\[\mathop {\hat \mu }\nolimits_n {\rm{ }}(k) = k(\mathop {\rm{T}}\nolimits_{\rm{n}} ){\rm{ }}\mathop {{\rm{\bar X}}}\nolimits_n {\rm{ }} + {\rm{ }}(1{\rm{ }} - {\rm{ }}k(\mathop {\rm{T}}\nolimits_{\rm{n}} ))\mathop \mu \nolimits_n \] is considered, where % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-qqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xHapdbiqaaeGaciGaaiaabeqaamaabaabaaGcbaWaaubeaeqaje% aWbaGaamOBaaWcbeqcdawaaiaadsfaaaGccaqGGaGaaeypaiaabcca% caWGUbWaaWbaaSqabeaacaaIXaGaai4laiaaikdaaaGccaGGOaWaa0% aaaeaacaWGybaaamaaBaaajeaWbaGaamOBaaWcbeaakiaabccacqGH% sislcaqGGaWaaubeaeqajeaWbaGaaGimaaWcbeqdbaGaaeiVdaaaki% aacMcacaqGGaGaae4laiabeccaGiabeo8aZbaa!4C33!\[\mathop T\nolimits_n {\rm{ = }}n^{1/2} (\overline X _n {\rm{ }} - {\rm{ }}\mathop {\rm{\mu }}\nolimits_0 ){\rm{ /}} \sigma \] and k is a weight function. For certain choices of k, % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-qqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xHapdbiqaaeGaciGaaiaabeqaamaabaabaaGcbaWaaubeaeqaje% aWbaGaamOBaaWcbeqdbaGafqiVd0MbaKaaaaGccaqGGaGaaiikaiaa% dUgacaGGPaaaaa!3CEE!\[\mathop {\hat \mu }\nolimits_n {\rm{ }}(k)\] coincides with previously studied preliminary test and shrinkage estimators. We consider choosing k from a natural non-parametric family of weight functions so as to minimize average risk relative to a specified prior p. We study how, by varying p, the MSE efficiency (relative to \-X) properties of % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-qqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xHapdbiqaaeGaciGaaiaabeqaamaabaabaaGcbaWaaubeaeqaje% aWbaGaamOBaaWcbeqdbaGafqiVd0MbaKaaaaGccaqGGaGaaiikaiaa% dUgacaGGPaaaaa!3CEE!\[\mathop {\hat \mu }\nolimits_n {\rm{ }}(k)\] can be controlled. In the process, a certain robustness property of the usual family of posterior mean estimators, corresponding to the conjugate normal priors, is observed.     

Analysis of a class of fractional programming problems

We propose a solution strategy for fractional programming problems of the form max _xx g(x)/ (u(x)), where the function satisfies certain convexity conditions. It is shown that subject to these conditions optimal solutions to this problem can be obtained from the solution of the problem max _xx g(x) + u(x), where is an exogenous parameter. The proposed strategy combines fractional programming andc-programming techniques. A maximal mean-standard deviation ratio problem is solved to illustrate the strategy in action.     

Supercritical fluid chromatography of industrial paraffins and waxes

Summary The application of capillary SFC for SIMDIST investigations of paraffins and waxes is reported. Pressure, density and temperature of the mobile phase are optimized to obtain high chromatographic resolution of complex mixtures of industrial products. Isothermal linear pressure programming and asymptotic pressure and density programming are used in the range from 15 to 35 MPa in the isothermic mode above 100°C. SFC chromatograms of natural and synthetic paraffins, microcrystalline wax and candle wax are compared. The retention behaviour of paraffin mixtures and waxes has been investigated on methyl/phenyl and biphenyl capillary columns. The polarity of the stationary phases influences the absolute retention time more than it influences the chromatographic resolution.     

Evaluating dredging and offshore loading locations for U.S. coal exports using the local logistics system

The formulation and use of a mixed integer mathematical programming location-allocation model, the Coal Logistics System (COLS), is presented in this study. COLS is used to evaluate the potential for reducing water-borne coal transportation costs, and concomitantly the costs of delivering coal to European markets. This cost reduction is accomplished through the use of supercolliers which would require the dredging of channels at selected ports or the use of offshore loading sites at East and Gulf Coast ports or both. The model developed and the analysis presented in this paper are intended to aid in the determination of the location and extent of these activities, and to indicate the size of the potential reduction in the costs of U.S. export coal. In order to be able to accommodate these deeper draft vessels at East and Gulf Coast ports, expensive improvements would need to be undertaken which may include the deepening of harbor channels to the depths required for 120 000 dead weight ton (dwt) or larger supercolliers. Since dredging requires large initial investments and has significant long-term maintenance costs, excess capacity could represent an inefficient use of both U.S. revenues and the ports' own funds. The use of offshore loading moorings to permit the topping off of supercolliers by self-unloading colliers at the deepwater sections of harbor channels has been proposed as a way of reducing trans-ocean transportation costs and avoiding the large investments and time delays associated with dredging activities. The Coal Logistics System was modified and extended to enable the evaluation of these two port improvement options to be undertaken in a consistent and realistic manner.     

最小一乘稳健多元分析校正

本文论述最小一乘求解的多元分析校正算法，探讨了最小一乘较常规最小二乘法及其他隐健算法的优点。用计算机数值模拟及实际多组分光谱体系对方法进行了检验，展示了最小一乘法在分析化学计量学中实际应用的可行性。     

Improving constants of strong convexity in linear stochastic programming

We derive formulas for constants of strong convexity (CSCs) of expectation functions encountered in two-stage stochastic programs with linear recourse. One of them yields a CSC as the optimal value of a certain quadratically constrained quadratic program, another one in terms of the thickness of the feasibility polytope of the dual problem associated to the recourse problem. CSCs appear in Hoelder-type estimates relating the distance of optimal solution sets of stochastic programs to a suitable distance of underlying probability distributions.     

含有偏好的DEA-BWM评价方法研究

针对传统的DEA模型在评估过程中并未考虑决策者对相关指标权重的偏好,将最优最差方法(BWM)嵌入到传统DEA模型中,基于决策者偏好排序的判断矩阵,构建一种含有偏好的DEA-BWM评价方法。首先在保持传统DEA方法的优势基础上,构建了CCR-BWM评价模型对各DMU进行评价。同时考虑为了便于各决策单元在统一权重基础上相互比较,构建了CSW-BWM公共权重模型。另外考虑决策单元自评和互评,构建了NCE-BWM中立型交叉效率。然后采用min-max方法分别将上述三种多目标评价模型转换为单目标线性规划进行求解。最后,选择一组算例对三种模型的有效性与合理性进行验证。