Second-order necessary optimality conditions for domain optimization problems of the Neumann type

In this paper, we treat a domain optimization problem in which the boundary-value problem is a Neumann problem. In the case where the domain is in a three-dimensional Euclidean space, the first-order and the second-order necessary conditions which the optimal domain must satisfy are derived under a constraint which is the generalization of the requisite of constant volume.Portions of this paper were presented at the 13th IFIP Conference on System Modelling and Optimization, Tokyo, Japan, 1987.     

Continuity properties of the normal cone to the level sets of a quasiconvex function

Two main properties of the subgradient mapping of convex functions are transposed for quasiconvex ones. The continuity of the functionxf(x)^–1f(x) on the domain where it is defined is deduced from some continuity properties of the normal coneN to the level sets of the quasiconvex functionf. We also prove that, under a pseudoconvexity-type condition, the normal coneN(x) to the set {x:f(x)f(x)} can be expressed as the convex hull of the limits of type {N(x _n)}, where {x _n} is a sequence converging tox and contained in a dense subsetD. In particular, whenf is pseudoconvex,D can be taken equal to the set of points wheref is differentiable.This research was completed while the second author was on a sabbatical leave at the University of Montreal and was supported by a NSERC grant. It has its origin in the doctoral thesis of the first author (Ref. 1), prepared under the direction of the second author.The authors are grateful to an anonymous referee and C. Zalinescu for their helpful remarks on a previous version of this paper.     

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.     

On sequential procedures for the point estimation of the mean of a normal population

The sequential procedures developed by Starr (1966, Ann. Math. Statist., 37, 1173–1185) for estimating the mean of a normal population are further analyzed. Asymptotic properties of the regret and first two moments of the stopping rules are studied and second-order approximations are derived.     

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.     

Relativistic atomic natural orbital type basis sets for the alkaline and alkaline-earth atoms applied to the ground-state potentials for the corresponding dimers

New basis sets of the atomic natural orbital (ANO) type have been developed for the atoms Li–Fr and Be–Ra. The ANOs have been obtained from the average density matrix of the ground states and the lowest excited states of the atom, the positive ion, and the dimer at its equilibirium geometry. Scalar realtivisitc effects are included through the use of a Douglas–Kroll Hamiltonian. Multiconfigurational wave functions have been used with dynamic correlation included using second-order perturbation theory (CASSCF/CASPT2). The basis sets are applied in calculations of the ground-state potentials for the dimers. Computed bond energies are accurate to within 0.05 eV for the alkaline dimers and 0.02 eV for the alkaline-earth dimers (except for Be₂).Acknowledgments.ensp;B.O.R. would like to express his gratitude to Prof. Jacopo Tomasi for all the inspiration that his scientific work has given him through the years and continues to do in particular through the work on solvent effects on molecular properties. This work has been supported by a grant from the Swedish Science Research Council, VR.Contribution to the Jacopo Tomasi Honorary Issue