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 …

We present a new primal-dual path-following interior-point algorithm for linear
complementarity problem over symmetric cones. The algorithm is based on a reformulation …

We present a general-purpose interior-point solver for convex optimization problems with
conic constraints. Our method is based on a homogeneous embedding method originally …

We present an interior-point method for monotone linear complementarity problems over
symmetric cones (SCLCP) that is based on barrier functions which are defined by a large …

In this paper, we have introduced the concepts of pseudomonotonicity properties for
nonlinear transformations defined on Euclidean Jordan algebras. The implications between …

A novel primal-dual path-following interior-point algorithm for the Cartesian P*(Κ)-linear
complementarity problem over symmetric cones is presented. The algorithm is based on a …

This paper investigates finite-dimensional variational inequalities and complementarity
problems, bilevel programming problems and mathematical programs with equilibrium …

考虑有限维变分不等式与互补问题, 双层规划以及均衡约束的数学规划问题.
在简单介绍这些问题之后, 重点介绍近年来这些领域中发展迅速的几个研究方向 …

Kernel functions play an important role in defining new search directions for interior-point
algorithms for solving monotone linear complementarity problems. In this paper we present …

Conic optimization has been widely used in many areas, such as machine learning, image
processing and automatic control. It usually relies on iterative algorithms to find the optimum …