We study randomized variants of two classical algorithms: coordinate descent for systems of
linear equations and iterated projections for systems of linear inequalities. Expanding on a …

This paper proposes a three-stage procedure for parametric identification of piecewise affine
autoregressive exogenous (PWARX) models. The first stage simultaneously classifies the …

Constrained optimization models are core tools in business, science, government, and the
military with applications including airline scheduling, control of petroleum refining …

Often in applications ranging from medical imaging and sensor networks to error correction
and data science (and beyond), one needs to solve large-scale linear systems in which a …

A new multi-generation of cuts algorithm is presented in this paper to improve the efficiency
of Benders decomposition approach for the cases that optimality cuts are difficult to be …

CONTEXT: Web Services are emerging technologies that enable application to application
communication and reuse of autonomous services over Web. Composition of web services …

This paper addresses the problem of identification of piecewise affine (PWA) models. This
problem involves the estimation from data of both the parameters of the affine submodels …

We consider linear systems where consists of normalized rows,, and where up to entries of
have been corrupted (possibly by arbitrarily large numbers). Haddock, Needell, Rebrova & …

We consider the Max FS problem: For a given infeasible linear system A x≤ b, determine a
feasible subsystem containing as many inequalities as possible. This problem, which is NP …

The maximum feasible subset problem (maxFS) is this: given an infeasible set of constraints,
find a largest cardinality subset that admits a feasible solution. This problem is NP-hard but …