Hard constraints are represented by inequalities. Hard constraints occur frequently in
practical systems and their models; these hard constraints are often used in optimization …

There recently has been much interest in studying optimization problems over symmetric
cones. In this paper, we first investigate a smoothing function in the context of symmetric …

This paper extends the regularized smoothing Newton method in vector complementarity
problems to symmetric cone complementarity problems (SCCP), which includes the …

This article deals with linear complementarity problems over symmetric cones. Our objective
here is to characterize global uniqueness and solvability properties for linear …

For the second-order cone linear complementarity problems, abbreviated as SOCLCPs, we
establish two classes of modulus-based matrix splitting iteration methods, which are …

The complementarity problem over a symmetric conic (that we call the Symmetric Conic
Complementarity Problem, or the SCCP) has received much attention of researchers in the …

In this article, based on the min–max theorem of Hirzebruch, we formulate and prove the
Cauchy interlacing theorem in simple Euclidean Jordan algebras. As a consequence, we …

In this paper, we propose a smoothing algorithm for solving the monotone symmetric cone
complementarity problems (SCCP for short) with a nonmonotone line search. We show that …

Thermal properties of rocks are essential parameters for investigating the geothermal
regime of sedimentary basins, and they are also important factors in assessments of …

In this paper, we present a feasible interior-point method (IPM) for the Cartesian P*(κ)-linear
complementarity problem over symmetric cones (SCLCP) that is based on the classical …