Convergence analysis for Lasserre’s measure-based hierarchy of upper bounds for polynomial optimization

We consider the problem of minimizing a continuous function f over a compact set \({\mathbf {K}}\). We analyze a hierarchy of upper bounds proposed by Lasserre (SIAM J Optim 21(3):864–885, 2011), obtained by searching for an optimal probability density function h on \({\mathbf {K}}\) which is a sum of squares of polynomials, so that the expectation \(\int _{{\mathbf {K}}} f(x)h(x)dx\) is minimized. We show that the rate of convergence is no worse than \(O(1/\sqrt{r})\), where 2r is the degree bound on the density function. This analysis applies to the case when f is Lipschitz continuous and \({\mathbf {K}}\) is a full-dimensional compact set satisfying some boundary condition (which is satisfied, e.g., for convex bodies). The rth upper bound in the hierarchy may be computed using semidefinite programming if f is a polynomial of degree d, and if all moments of order up to \(2r+d\) of the Lebesgue measure on \({\mathbf {K}}\) are known, which holds, for example, if \({\mathbf {K}}\) is a simplex, hypercube, or a Euclidean ball.     

Families of curves with ordinary singular points on regular surfaces

Sunto Fissata una superficie algebrica liscia X sopra un campo algebricamente chiuso e di caratteristica 0, e una curva ridotta C su X, si introduce, per ogni -upla di numeri naturali m₁,..., m, uno schema W=W(C, m₁,..., m), parametrizzante le curve del sistema lineare ¦C¦ con punti multipli ordinari di molteplicità almeno m₁,..., m. Si studia W in relazione con la configurazione delie singolarità e delle componenti irriducibili di C. Si prova in particolare un teorema di «virtuale connessione», che permette di stabilire l'esistenza di curve irriducibili in alcuni di tali schemi W.

---

---

Membro del G.N.S.A.G.A. del C.N.R.     

Redefining Event Variables for Efficient Modeling of Continuous-Time Batch Processing

We define events so as to reduce the number of events and decision variables needed for modeling batch-scheduling problems such as described in [15]. We propose a new MILP formulation based on this concept, defining non-uniform time periods as needed and decision variables that are not time-indexed. It can handle complicated multi-product/multi-stage machine processes, with production lines merging and diverging, and with minimum and maximum batch sizes. We compare it with earlier models and show that it can solve problems with small to medium demands relative to batch sizes in reasonable computer times.     

Triangulations in CGAL

This paper presents the main algorithmic and design choices that have been made to implement triangulations in the computational geometry algorithms library .     

A Phase-Space Study of the Quantum Loschmidt Echo in the Semiclassical Limit

The notion of Loschmidt echo (also called “quantum fidelity”) has been introduced in order to study the (in)-stability of the quantum dynamics under perturbations of the Hamiltonian. It has been extensively studied in the past few years in the physics literature, in connection with the problems of “quantum chaos”, quantum computation and decoherence. In this paper, we study this quantity semiclassically (as ), taking as reference quantum states the usual coherent states. The latter are known to be well adapted to a semiclassical analysis, in particular with respect to semiclassical estimates of their time evolution. For times not larger than the so-called “Ehrenfest time” , we are able to estimate semiclassically the Loschmidt Echo as a function of t (time), (Planck constant), and δ (the size of the perturbation). The way two classical trajectories merging from the same point in classical phase-space, fly apart or come close together along the evolutions governed by the perturbed and unperturbed Hamiltonians play a major role in this estimate. We also give estimates of the “return probability” (again on reference states being the coherent states) by the same method, as a function of t and . Submitted: April 27, 2006; Accepted: May 11, 2006     

Degenerate nonlinear hyperbolic conservation laws: Non classical geometrical theory

Kinetic selection principles have been shown to be useful and physically reasonable in nonlinear hyperbolic problems with large amplitude phase transitions. We refer to Abeyaratne and Knowles, [A-K], for discussion on the subject. They also have been used for degenerate nonlinear problems, where the genuine nonlinearity property of Lax is violated. This is the framework of Liu, [Li], in the kinetic situation of Hayes and Le Floch, [H-L], where their so-called non classical shocks may be seen as small amplitude phase transitions. Here, we describe the local geometry generated by the generic non genuinely nonlinear assumption. A geometric kinetic criterion can be used to select indeterminate simple waves and obtain the well-posedness of the local Riemann problem. A particular case is the entropic kinetic criterion of Hayes and Le Floch.

---

Sunto Principi di selezione cinetica sono stati mostrati utili e fisicamente ragionevoli in problemi iperbolici con transizioni di fase di grande ampiezza. Ci riferiamo ad Abeyaratne e Knowles, [A-K], per discussioni sull'argomento. Detti principi sono stati usati per problemi nonlineari degeneri, dove la proprietà di genuina nonlinearità di Lax è violata. Questo è la prospettiva di Liu, [Li], nella situazione cinetica di Hayes e Le Floch, [H-L], dove i loro così detti urti non classici possono essere considerati come transizioni di fase di piccola ampiezza. Qui, descriviamo la geometria locale generata dall'ipotesi generica genuinamente nonlineare. Un criterio di geometria cinetica può essere usato per selezionare onde semplici indeterminate ed ottenere la buona posizione per il problema locale di Riemann. Un caso particolare è il criterio di entropia cinetico di Hayes e Le Floc.

     

Secondary-ion mass spectrometry as a quantitative microanalytical technique

Recent progress in ion microscopy and ion-microprobe analysis is reviewed with special emphasis on the potential of the method for the determination of impurities in locally restricted areas of the sample. Emphasis is placed on the calibration of the depth scale and on the potential of the method for three-dimensional analysis.     

Simplified liquid chromatographic determination of glyphosate and metabolite residues in environmental water using post-column fluorogenic labelling

Glyphosate and its metabolite aminomethylphosphonic acid in environmental water can be preconcentrated with an anion-exchange column, eluted with potassium citrate solution and determined directly by liquid chromatography with a post-column reactor and a fluorescence detector. The limit of detection and average recovery are 1 μg 1^?1 and 89.3% for glyphosate and 0.4 μg l^?1 and 86.3% for the metabolite.