Large-scale optimization problems that seek sparse solutions have become ubiquitous. They are routinely solved with various specialized first-order methods. Although such methods often fast, they usually struggle not-so-well-conditioned problems. In this paper, variants of an interior point-proximal method multipliers proposed and analyzed for class. Computational experience on a variety proble...

we present a modified version of the infeasible-interior- we present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by mansouri et al. (nonlinear anal. real world appl. 12(2011) 545--561). each main step of the algorithm consists of a feasibility step and several centering steps. we use a different feasibility step, which targ...

3. page 13, lines 12–13: Insert a phrase to stress that we consider only monotone LCP in this book, though the qualifier ”monotone” is often omitted. Replace the sentence preceding the formula (1.21) by The monotone LCP—the qualifier ”monotone” is implicit throughout this book—is the problem of finding vectors x and s in I R that satisfy the following conditions: 4. page 13, line −12: delete “o...