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...

Reverse engineering of program code is the process of constructing a higher level abstraction of an implementation in order to facilitate the understanding of a system that may be in a \legacy" or \geriatric" state. Changing architectures and improvements in programming methods, including formal methods in software development and object-oriented programming , have prompted a need to reverse en...