Search arXivSearch

arXiv subjects

P. Merino

Publications and source records attributed to P. Merino.

2 recordsLinked to original sources

On-surface dehydrogenative lateral homo-coupling and aromatization of n-octane on Pt(111)

Aliphatic hydrocarbons, such as normal alkanes, constitute a naturally abundant source of carbon atoms. Of special interest is the formation of cyclic and aromatic products from aliphatic reactants. Combining scanning tunneling microscopy and ab initio calculations, we investigate the thermal induced aromatization of linear n octane molecules on the catalytic Pt(111) surface and the reactions of intermolecular homocoupling between them at temperatures above 600 K. The cycloaromatization of individual n octane molecules requires bending the linear adsorbates prior to their dehydrogenation and the formation of an intramolecular C-C bond, yielding adsorbed benzene rings. In addition, the Pt(111) surface catalyzes a homocoupling reaction by initiating the formation of a C-C bond between the dehydrogenated methyl ends of the chemisorbed n octane molecules and then propagating along the carbon backbone in a zipper like fashion. Our findings provide molecular level insight into the heterogeneous catalytic processes underlying the generation of aromatic products and stable on surface polycyclic species.

cond-mat.mtrl-sci

Second-order orthant-based methods with enriched Hessian information for sparse $\ell_1$-optimization

We present a second order algorithm, based on orthantwise directions, for solving optimization problems involving the sparsity enhancing $\ell_1$-norm. The main idea of our method consists in modifying the descent orthantwise directions by using second order information both of the regular term and (in weak sense) of the $\ell_1$-norm. The weak second order information behind the $\ell_1$-term is incorporated via a partial Huber regularization. One of the main features of our algorithm consists in a faster identification of the active set. We also prove that a reduced version of our method is equivalent to a semismooth Newton algorithm applied to the optimality condition, under a specific choice of the algorithm parameters. We present several computational experiments to show the efficiency of our approach compared to other state-of-the-art algorithms.

math.OC