DOI: 10.3390/math11173719 ISSN:

A Smoothing Method for Sparse Programs by Symmetric Cone Constrained Generalized Equations

Cong Cheng, Lianjie Tang
  • General Mathematics
  • Engineering (miscellaneous)
  • Computer Science (miscellaneous)

In this paper, we consider a sparse program with symmetric cone constrained parameterized generalized equations (SPSCC). Such a problem is a symmetric cone analogue with vector optimization, and we aim to provide a smoothing framework for dealing with SPSCC that includes classical complementarity problems with the nonnegative cone, the semidefinite cone and the second-order cone. An effective approximation is given and we focus on solving the perturbation problem. The necessary optimality conditions, which are reformulated as a system of nonsmooth equations, and the second-order sufficient conditions are proposed. Under mild conditions, a smoothing Newton approach is used to solve these nonsmooth equations. Under second-order sufficient conditions, strong BD-regularity at a solution point can be satisfied. An inverse linear program is provided and discussed as an illustrative example, which verified the efficiency of the proposed algorithm.

More from our Archive