International audienceNonlinear elastic waveform inversion has advanced to the point where it is now possible to invert real multiple‐shot seismic data. The iterative gradient algorithm that we employ can readily accommodate robust minimization criteria which tend to handle many types of seismic noise (noise bursts, missing traces, etc.) better than the commonly used least‐squares minimization criteria. Although there are many robust criteria from which to choose, we have tested only a few. In particular, the Cauchy criterion and the hyperbolic secant criterion perform very well in both noise‐free and noise‐added inversions of numerical data. Although the real data set, which we invert using the sech criterion, is marine (pressure sources and receivers) and is very much dominated by unconverted P waves, we can, for the most part, resolve the short wavelengths of both P impedance and S impedance. The long wavelengths of velocity (the background) are assumed known. Because we are deriving nearly all impedance information from unconverted P waves in this inversion, data acquisition geometry must have sufficient multiplicity in subsurface coverage and a sufficient range of offsets, just as in amplitude‐versus‐offset (AVO) inversion. However, AVO analysis is implicitly contained in elastic waveform inversion algorithms as part of the elastic wave equation upon which the algorithms are based. Because the real‐data inversion is so large—over 230,000 unknowns (340,000 when density is included) and over 600,000 data values—most statistical analyses of parameter resolution are not feasible. We qualitatively verify the resolution of our results by inverting a numerical data set which has the same acquisition geometry and corresponding long wavelengths of velocity as the real data, but has semirandom perturbations in the short wavelengths of P and S impedance

No abstract

Improving Hit-and-Run is a random search algorithm for global optimization that at each iteration generates a candidate point for improvement that is uniformly distributed along a randomly chosen direction within the feasible region. The candidate point is accepted as the next iterate if it offers an improvement over the current iterate. We show that for positive definite quadratic programs, the expected number of function evaluations needed to arbitrarily well approximate the optimal solution is at most O(n 5~2) where n is the dimension of the problem. Improving Hit-and-Run when applied to global optimization problems can therefore be expected to converge polynomially fast as it approaches the global optimum.

The demand for energy is normally broken down into five sectors: industry, utilities, the residential sector, the commercial sector, and transportation. Industry is the most heterogeneous of these with manufacturing accounting for about 80 percent of total industrial energy demand. Manufacturing is itself a very heterogeneous collection of production activities. As defined by the Standard Industrial Classification (SIC) method of the U.S. Department of Commerce, there were 448 manufacturing sectors in 1972.

No abstract