Finite determinacy and Whitney equisingularity of map germs from C(n) to C(2n-1)

We show that a holomorphic map germ f : (C(n), 0) -> (C(2n-1), 0) is finitely determined if and only if the double point scheme D(f) is a reduced curve. If n >= 3, we have that mu(D(2)(f)) = 2 mu(D(2)(f)/S(2))+C(f)-1, where D(2)(f) is the lifting of the double point curve in (C(n) x C(n), 0), mu(X) denotes the Milnor number of X and C(f) is the number of cross-caps that appear in a stable deformation of f. Moreover, we consider an unfolding F(t, x) = (t, f(t)(x)) of f and show that if F is mu-constant, then it is excellent in the sense of Gaffney. Finally, we find a minimal set of invariants whose constancy in the family f(t) is equivalent to the Whitney equisingularity of F. We also give an example of an unfolding which is topologically trivial, but it is not Whitney equisingular.

The doodle of a finitely determined map germ from R(2) to R(3)

Let f : U subset of R(2) -> R(3) be a representative of a finitely determined map germ f : (R(2), 0) -> (R(3), 0). Consider the curve obtained as the intersection of the image of the mapping f with a sufficiently small sphere s(epsilon)(2) centered at the origin in R(3), call this curve the associated doodle of the map germ f. For a large class of map germs the associated doodle has many transversal self-intersections. The topological classification of such map germs is considered from the point of view of the associated doodles. (C) 2009 Elsevier Inc. All rights reserved.

Proximal methods for nonlinear programming: double regularization and inexact subproblems

This paper describes the first phase of a project attempting to construct an efficient general-purpose nonlinear optimizer using an augmented Lagrangian outer loop with a relative error criterion, and an inner loop employing a state-of-the art conjugate gradient solver. The outer loop can also employ double regularized proximal kernels, a fairly recent theoretical development that leads to fully smooth subproblems. We first enhance the existing theory to show that our approach is globally convergent in both the primal and dual spaces when applied to convex problems. We then present an extensive computational evaluation using the CUTE test set, showing that some aspects of our approach are promising, but some are not. These conclusions in turn lead to additional computational experiments suggesting where to next focus our theoretical and computational efforts.

Improved Prediction of Hydrocarbon Flash Points from Boiling Point Data

Flash points (T(FP)) of hydrocarbons are calculated from their flash point numbers, N(FP), with the relationship T(FP) (K) = 23.369N(FP)(2/3) + 20.010N(FP)(1/3) + 31.901 In turn, the N(FP) values can be predicted from experimental boiling point numbers (Y(BP)) and molecular structure with the equation N(FP) = 0.987 Y(BP) + 0.176D + 0.687T + 0.712B - 0.176 where D is the number of olefinic double bonds in the structure, T is the number of triple bonds, and B is the number of aromatic rings. For a data set consisting of 300 diverse hydrocarbons, the average absolute deviation between the literature and predicted flash points was 2.9 K.