On solving a D.C. programming problem by a sequence of linear programs

We are dealing with a numerical method for solving the problem of minimizing a difference of two convex functions (a d.c. function) over a closed convex set in ⁿ . This algorithm combines a new prismatic branch and bound technique with polyhedral outer approximation in such a way that only linear programming problems have to be solved.Parts of this research were accomplished while the third author was visiting the University of Trier, Germany, as a fellow of the Alexander von Humboldt foundation.     

Generalizations of Slater's constraint qualification for infinite convex programs

In this paper we study constraint qualifications and duality results for infinite convex programs (P) = inf{f(x): g(x) – S, x C}, whereg = (g ₁,g ₂) andS = S ₁ ×S ₂,S _i are convex cones,i = 1, 2,C is a convex subset of a vector spaceX, andf andg _i are, respectively, convex andS _i -convex,i = 1, 2. In particular, we consider the special case whenS ₂ is in afinite dimensional space,g ₂ is affine andS ₂ is polyhedral. We show that a recently introduced simple constraint qualification, and the so-called quasi relative interior constraint qualification both extend to (P), from the special case thatg = g ₂ is affine andS = S ₂ is polyhedral in a finite dimensional space (the so-called partially finite program). This provides generalized Slater type conditions for (P) which are much weaker than the standard Slater condition. We exhibit the relationship between these two constraint qualifications and show how to replace the affine assumption ong ₂ and the finite dimensionality assumption onS ₂, by a local compactness assumption. We then introduce the notion of strong quasi relative interior to get parallel results for more general infinite dimensional programs without the local compactness assumption. Our basic tool reduces to guaranteeing the closure of the sum of two closed convex cones.     

On laplace continued fraction for the normal integral

The Laplace continued fraction is derived through a power series. It provides both upper bounds and lower bounds of the normal tail probability % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiGc9yrFr0xXdbba91rFfpec8Eeeu0x% Xdbba9frFj0-OqFfea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs% 0dXdbPYxe9vr0-vr0-vqpWqaaeaabiGaciaacaqabeaadaqaaqGaaO% qaaiqbfA6agzaaraaaaa!3DC0!\[\bar \Phi\](x), it is simple, it converges for x>0, and it is by far the best approximation for x3. The Laplace continued fraction is rederived as an extreme case of admissible bounds of the Mills' ratio, % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiGc9yrFr0xXdbba91rFfpec8Eeeu0x% Xdbba9frFj0-OqFfea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs% 0dXdbPYxe9vr0-vr0-vqpWqaaeaabiGaciaacaqabeaadaqaaqGaaO% qaaiqbfA6agzaaraaaaa!3DC0!\[\bar \Phi\](x)/(x), in the family of ratios of two polynomials subject to a monotone decreasing absolute error. However, it is not optimal at any finite x. Convergence at the origin and local optimality of a subclass of admissible bounds are investigated. A modified continued fraction is proposed. It is the sharpest tail bound of the Mills' ratio, it has a satisfactory convergence rate for x1 and it is recommended for the entire range of x if a maximum absolute error of 10^-4 is required.The efforts of the author were supported by the NSERC of Canada.     

Modified AutoDock for accurate docking of protein kinase inhibitors

Protein kinases are an important class of enzymes controlling virtually all cellular signaling pathways. Consequently, selective inhibitors of protein kinases have attracted significant interest as potential new drugs for many diseases. Computational methods, including molecular docking, have increasingly been used in the inhibitor design process [1]. We have considered several docking packages in order to strengthen our kinase inhibitor work with computational capabilities. In our experience, AutoDock offered a reasonable combination of accuracy and speed, as opposed to methods that specialize either in fast database searches or detailed and computationally intensive calculations.However, AutoDock did not perform well in cases where extensive hydrophobic contacts were involved, such as docking of SB203580 to its target protein kinase p38. Another shortcoming was a hydrogen bonding energy function, which underestimated the attraction component and, thus, did not allow for sufficiently accurate modeling of the key hydrogen bonds in the kinase-inhibitor complexes.We have modified the parameter set used to model hydrogen bonds, which increased the accuracy of AutoDock and appeared to be generally applicable to many kinase-inhibitor pairs without customization. Binding to largely hydrophobic sites, such as the active site of p38, was significantly improved by introducing a correction factor selectively affecting only carbon and hydrogen energy grids, thus, providing an effective, although approximate, treatment of solvation.     

Convexifactors,generalized convexity and vector optimization

In this article we study a recently introduced notion of non-smooth analysis, namely convexifactors. We study some properties of the convexifactors and introduce two new chain rules. A new notion of non-smooth pseudoconvex function is introduced and its properties are studied in terms of convexifactors. We also present some optimality conditions for vector minimization in terms of convexifactors.     

Propagation of a pre-existing turbulent fluid fracture

The propagation of rough and smooth wall pre-existing turbulent fluid fractures is investigated. The laminar fluid fracture is included as a special case for comparison. Lubrication theory is assumed to apply in the fracture and turbulence is introduced through the wall shear stress. The Perkins–Kern–Nordgren approximation is made in which the fluid pressure is proportional to the half-width of the fracture. The fracture half-width satisfies a non-linear diffusion equation. By using a linear combination of the Lie point symmetries of the non-linear diffusion equation a group invariant solution for the fracture length, volume and half-width is derived. The evolution of the length, half-width and mean flow velocity is analysed for a range of working conditions at the fracture entry. It is found that the mean flow velocity increases approximately linearly along the fracture.     

Continuous time markov decision processes with interventions

We study Markov jump decision processes with both continuously and instantaneouslyacting decisions and with deterministic drift between jumps. Such decision processes were recentlyintroduced and studied from discrete time approximations point of view by Van der Duyn Schouten.Weobtain necessary and sufficient optimality conditions for these decision processes in terms of equations and inequalities of quasi-variational type. By means of the latter we find simple necessaryand sufficient conditions for the existence of stationary optimal policies in such processes with finite state and action spaces, both in the discounted and average per unit time reward cases.     

Approximating exponential and logarithmic functions using polynomial interpolation

This article takes a closer look at the problem of approximating the exponential and logarithmic functions using polynomials. Either as an alternative to or a precursor to Taylor polynomial approximations at the precalculus level, interpolating polynomials are considered. A measure of error is given and the behaviour of the error function is analysed. The results of interpolating polynomials are compared with those of Taylor polynomials.     

Approximation by complex szász-durrmeyer operators in compact disks

In the present paper, we deal with the complex Szász-Durrmeyer operators and study Voronovskaja type results with quantitative estimates for these operators attached to analytic functions of exponential growth on compact disks. Also, the exact order of approximation is found.