output
20012026
most citedImproved search for muon-neutrino to electron-neutrino oscillations in MINOS

696 citations

Showing 2013Show all

23 papers · 1 filter

math.OC2013★ 1 cited

A Relaxed-Projection Splitting Algorithm for Variational Inequalities in Hilbert Spaces

J. Y. Bello Cruz, R. Diaz Millan

We introduce a relaxed-projection splitting algorithm for solving variational inequalities in Hilbert spaces for the sum of nonsmooth maximal monotone operators, where the feasible…

quant-ph2013★ 15 cited

A new view on spin reduced density matrix for relativistic particles

E. R. F. Taillebois, A. T. Avelar

We present a new interpretation for reduced density matrices of secondary variables in relativistic systems via an analysis of Wigner's method to construct the irreducible unitary…

math.AP2013

Nonlinear Boundary Value Problems via Minimization on Orlicz-Sobolev Spaces

J. V. Goncalves, M. L. M. Carvalho

We develop arguments on convexity and minimization of energy functionals on Orlicz-Sobolev spaces to investigate existence of solution to the equation $\displaystyle -\mbox{div} (ϕ…

stat.ME2013

Aggregated functional data model for Near-Infrared Spectroscopy calibration and prediction

Ronaldo Dias, Nancy L. Garcia, Guilherme Ludwig +1

Calibration and prediction for NIR spectroscopy data are performed based on a functional interpretation of the Beer-Lambert formula. Considering that, for each chemical sample, the…

math.NA2013

Local convergence analysis of Inexact Newton method with relative residual error tolerance under majorant condition in Riemannian Manifolds

T. Bittencourt, O. P. Ferreira

A local convergence analysis of Inexact Newton's method with relative residual error tolerance for finding a singularity of a differentiable vector field defined on a complete Riem…

math.OC2013★ 19 cited

The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle

Heinz H. Bauschke, J. Y. Bello Cruz, Tran T. A. Nghia +2

The Douglas-Rachford splitting algorithm is a classical optimization method that has found many applications. When specialized to two normal cone operators, it yields an algorithm…