A Barrier-Based Smoothing Proximal Point Algorithm for NCPs over Closed Convex Cones

Abstract

We present a new barrier-based method of constructing smoothing approximations for the Euclidean projector onto closed convex cones. These smoothing approximations are used in a smoothing proximal point algorithm to solve monotone nonlinear complementarity problems (NCPs) over a convex cone via the normal map equation. The smoothing approximations allow for the solution of the smoothed normal map equations with Newton's method and do not require additional analytical properties of the Euclidean projector. The use of proximal terms in the algorithm adds stability to the solution of the smoothed normal map equation and avoids numerical issues due to ill-conditioning at iterates near the boundary of the cones. We prove a sufficient condition on the barrier used that guarantees the convergence of the algorithm to a solution of the NCP. The sufficient condition is satisfied by all logarithmically homogeneous barriers. Preliminary numerical tests on semidefinite programming problems show that our algorithm is comparable with the Newton-CG augmented Lagrangian algorithm proposed in [X.

A Global Linear and Local Superlinear (Quadratic) Inexact Non-Interior Continuation Method for Variational Inequalities Over General Closed Convex Sets

“…However, it is not computable in most cases since it contains a multivariate integral. Recently, C. B. Chua and Z. Li [16] introduced barrier-based smoothing functions, which only approximate the Euclidean projection onto convex cone with nonempty interior. This type of SAs has been extended to general closed convex sets with non-empty interior in [15].…”