Abstract: In this paper, we delve into the monotone sub-modular maximization problem with a cardinality constraint. We propose a priority-ordered swapping algorithm that iteratively improves the ...

Abstract: This paper considers the robust phase retrieval problem, which can be cast as a nonsmooth and nonconvex optimization problem. We propose a new inexact proximal linear algorithm with the ...

Standard computer implementations of Dantzig's simplex method for linear programming are based upon forming the inverse of the basic matrix and updating the inverse ...