<Para ID="Par1">This paper introduces three novel techniques for updating the invertible representation of the basis matrix when solving practical sparse linear programming problems using a high performance implementation of the dual revised simplex method, being of particular value when suboptimization is...</para>

Many applications in data analysis rely on the decomposition of a data matrix into a low-rank and a sparse component. Existing methods that tackle this task use the nuclear norm and <InlineEquation ID="IEq3"> <EquationSource Format="TEX">$$\ell _1$$</EquationSource> <EquationSource Format="MATHML"> <math xmlns:xlink="http://www.w3.org/1999/xlink"> <msub> <mi>ℓ</mi> <mn>1</mn> </msub> </math> </EquationSource> </InlineEquation>-cost functions as convex relaxations of the rank constraint and the sparsity measure,...</equationsource></equationsource></inlineequation>

The generalized persistence (GP) model, developed in the context of estimating “value added” by individual teachers to their students’ current and future test scores, is one of the most flexible value-added models in the literature. Although developed in the educational setting, the GP...

Consider a matrix valued function A(x)∈Rm×n, m≥n, smoothly depending on parameters x∈Ω⊂R2, where Ω is simply connected and bounded. We consider a technique to locate parameter values where some of the q dominant (q≤n) singular values of A coalesce, in the specific case when A is...

In this paper a computer tool for the simulation of the dynamic pantograph–catenary interaction is presented. We model this interaction and study its behavior in the energy transmission process. The calculation of the dynamic equation of the pantograph–catenary interaction is considered from...