On the Curvature of the Central Path of Linear Programming Theory

We prove a linear bound on the average total curvature of the central path of linear programming theory in terms of the number of independent variables of the primal problem, and independent of the number of constraints.     

A computational strategy for multiscale systems with applications to Lorenz 96 model

Numerical schemes for systems with multiple spatio-temporal scales are investigated. The multiscale schemes use asymptotic results for this type of systems which guarantee the existence of an effective dynamics for some suitably defined modes varying slowly on the largest scales. The multiscale schemes are analyzed in general, then illustrated on a specific example of a moderately large deterministic system displaying chaotic behavior due to Lorenz. Issues like consistency, accuracy, and efficiency are discussed in detail. The role of possible hidden slow variables as well as additional effects arising on the diffusive time-scale are also investigated. As a byproduct we obtain a rather complete characterization of the effective dynamics in Lorenz model.     

Internal standardization for the determination of cadmium,cobalt, chromium and manganese in saline produced water from petroleum industry by inductively coupled plasma optical emission spectrometry after cloud point extraction

In the present paper a procedure is proposed for the determination of traces of Cd, Co, Mn and Cr in petroleum industry produced water by inductively coupled plasma optical emission spectrometry. The procedure is based on cloud point extraction of these metals, as their dithizonate complexes, into the surfactant-rich phase of octylphenoxypolyethoxyethanol surfactant (Triton X-114). Extractions were carried out in solutions with salinities between 10‰ and 70‰. Since residual salinity in the surfactant-rich phase caused differences in its transport to the plasma, yttrium was used as an internal standard to correct for this effect. The simultaneous metal extraction procedure was optimized by response surface methodology using a Doehlert design and desirability function. Enhancement factors of 21, 21, 9 and 19, along with limits of quantification of 0.093, 0.20, 0.73 and 1.2 μg L^− 1, and precision expressed as relative standard deviation (n = 8, 20.0 μg L^− 1) of 5.8, 1.2, 1.7 and 5.7% were obtained for Cd, Co, Mn and Cr, respectively. The accuracy was evaluated by spike recovery tests on the high salinity water samples with salinity of 40 and 63‰.     

Convergence of multistep discretizations of DAEs

Standard ODE methods such as linear multistep methods encounter difficulties when applied to differential-algebraic equations (DAEs) of index greater than 1. In particular, previous results for index 2 DAEs have practically ruled out the use of all explicit methods and of implicit multistep methods other than backward difference formulas (BDFs) because of stability considerations. In this paper we embed known results for semi-explicit index 1 and 2 DAEs in a more comprehensive theory based on compound multistep and one-leg discretizations. This explains and characterizes the necessary requirements that a method must fulfill in order to be applicable to semi-explicit DAEs. Thus we conclude that the most useful discretizations are those that avoid discretization of the constraint. A freer use of e.g. explicit methods for the non-stiff differential part of the DAE is then possible.Dedicated to Germund Dahlquist on the occasion of his 70th birthdayThis author thanks the Centro de Estadística y Software Matemático de la Universidad Simón Bolivar (CESMa) for permitting her free use of its research facilities.Partial support by the Swedish Research Council for Engineering Sciences TFR under contract no. 222/91-405.     

Approximate Toeplitz Matrix Problem Using Semidefinite Programming

Given a data matrix, we find its nearest symmetric positive-semidefinite Toeplitz matrix. In this paper, we formulate the problem as an optimization problem with a quadratic objective function and semidefinite constraints. In particular, instead of solving the so-called normal equations, our algorithm eliminates the linear feasibility equations from the start to maintain exact primal and dual feasibility during the course of the algorithm. Subsequently, the search direction is found using an inexact Gauss-Newton method rather than a Newton method on a symmetrized system and is computed using a diagonal preconditioned conjugate-gradient-type method. Computational results illustrate the robustness of the algorithm.     

Asymptotic Methods Applied to Contact Problems

Asymptotic methods for contact problems are expounded. Some typical integral equations are considered     

An implicit characteristic-flux-averaging method for the euler equations for real gases

A formulation of an implicit characteristic-flux-averaging method for the unsteady Euler equations with real gas effects is presented. Incorporation of a real gas into a general equation of state is achieved by considering the pressure as a function of density and specific internal energy. The Ricmann solver as well as the flux-split algorithm are modified by introducing the pressure derivatives with respect to density and internal energy. Expressions for calculating the values of the flow variables for a real gas at the cell faces are derived. The Jacobian matrices and the eigenvectors are defined for a general equation of state. The solution of the system of equations is obtained by using a mesh-sequencing method for acceleration of the convergence. Finally, a test case for a simple form of equation of state displays the differences from the corresponding solution for an ideal gas.     

Ultrathin Fe film on Cu(0 0 1): Exchange splitting of image states from first principles

The theoretical investigation of the image states in front of an ultrathin iron film grown on copper has been performed by means of the embedding method and a recently developed procedure for the inclusion of the image potential tail in a first principle calculation. From the electronic response to an applied electric field, the image plane position has been evaluated. This also allows one to obtain useful information about the spin dependent screening properties of the system. Exchange splitting, effective mass, and lifetime of such surface states result in good agreement with recently performed two-photon photoemission experiments [see A.B. Schmidt, M. Pickel, M. Wiemhöfer, M. Donath, M. Weinelt, Phys. Rev. Lett. 95 (2005) 107402].     

Pattern Search Method for Discrete <Emphasis Type="Italic">L</Emphasis><Subscript>1</Subscript>–Approximation

We propose a pattern search method to solve a classical nonsmooth optimization problem. In a deep analogy with pattern search methods for linear constrained optimization, the set of search directions at each iteration is defined in such a way that it conforms to the local geometry of the set of points of nondifferentiability near the current iterate. This is crucial to ensure convergence. The approach presented here can be extended to wider classes of nonsmooth optimization problems. Numerical experiments seem to be encouraging. This work was supported by M.U.R.S.T., Rome, Italy.     

Constraint incorporation in optimization

Numerical methods for solving constrained optimization problems need to incorporate the constraints in a manner that satisfies essentially competing interests; the incorporation needs to be simple enough that the solution method is tractable, yet complex enough to ensure the validity of the ultimate solution. We introduce a framework for constraint incorporation that identifies a minimal acceptable level of complexity and defines two basic types of constraint incorporation which (with combinations) cover nearly all popular numerical methods for constrained optimization, including trust region methods, penalty methods, barrier methods, penalty-multiplier methods, and sequential quadratic programming methods. The broad application of our framework relies on addition and chain rules for constraint incorporation which we develop here.