Volumetric path following algorithms for linear programming

We consider the construction of small step path following algorithms using volumetric, and mixed volumetric-logarithmic, barriers. We establish quadratic convergence of a volumetric centering measure using pure Newton steps, enabling us to use relatively standard proof techniques for several subsequently needed results. Using a mixed volumetric-logarithmic barrier we obtain an O(n ^1/4 m ^1/4 L) iteration algorithm for linear programs withn variables andm inequality constraints, providing an alternative derivation for results first obtained by Vaidya and Atkinson. In addition, we show that the same iteration complexity can be attained while holding the work per iteration to O(n ² m), as opposed to O(nm ²), operations, by avoiding use of the true Hessian of the volumetric barrier. Our analysis also provides a simplified proof of self-concordancy of the volumetric and mixed volumetric-logarithmic barriers, originally due to Nesterov and Nemirovskii. This paper was first presented at the 1994 Faculty Research Seminar “Optimization in Theory and Practice”, at the University of Iowa Center for Advanced Studies.     

Role of stationary photon statistics in a high-Q cavity mode while it is exciting the active laser medium

It has been shown by Yu. M. Golubev, M. I. Kolobov, and I. V. Sokolov, Zh. éksp. Teor. Fiz. 111, 1579 (1997) [JETP 84, 864 (1997)], that when an optical cavity is excited by external radiation from a sub-Poisson laser the cavity mode may be in either a sub-Poisson or a Poisson stationary state. This is not important for a resonant medium which is excited into the upper laser level while interacting with this mode inside the cavity. The degree of regularity of the excitation will be identical to that of the initial light flux incident on the cavity, and this ultimately ensures the same sub-Poisson lasing as for strictly regular pumping of the resonant medium. Zh. éksp. Teor. Fiz. 113, 1223–1234 (April 1998)     

An asymptotic solution of the Cauchy problem for the Davey-Stewartson-I equation

We construct and asymptotic solution of the Cauchy problem for the Davey-Stewartson-I equation as t→∞. The solution, which is of order t⁻¹, is rapidly oscillating. The envelope of the oscillations can be defined by an integral equation. Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 114, No. 1, pp. 104–114, January, 1998.     

Thermal diffusivity measurements in porous ceramics by photothermal methods

Received: 16 September 1996/Accepted: 6 January 1997     

Forced-air precooling of spherical foods in bulk: A parametric study

In this paper, a mathematical model for forced-air precooling of spherical food products in bulk is developed. The foods are arranged in horizontal layers stacked one above the other to form a rectangular parallelepiped with a vertical gap in between the product layers. The foods are cooled by chilled air blown along the height of the package. The governing equations for the conduction heat transfer in the foods, simultaneous heat and mass transfer at the food-air interface and in the air stream are solved numerically using finite-difference methods. A comprehensive numerical study is performed by varying the process parameters over a wide range. Typical results showing the variation of moist air properties along the height of the package and the effect of each parameter on the process time are presented. The ranges of parameters for advantageous operation of the precooling system are identified. Correlations are obtained for the process time based on the product center and mass-averaged temperatures in terms of process parameters.     

On Producing Multiple Solutions Using Repeated Trials

The number of trials that is required by an algorithm to produce a given fraction of the problem solutions with a specified level of confidence is analyzed. The analysis indicates that the number of trials required to find a large fraction of the solutions rapidly decreases as the number of solutions obtained on each trial by an algorithm increases. In applications where multiple solutions are sought, this decrease in the number of trials could potentially offset the additional computational cost of algorithms that produce multiple solutions on a single trial. The analysis framework presented is used to compare the efficiency of a homotopy algorithm to that of a Newton method by measuring both the number of trials and the number of calculations required to obtain a specified fraction of the solutions.