Learn More
Recently, there has been much interest in studying linear second-order cone programming. This paper uses the Kanzow-Kleinmichel function for the second-order cone complementarity problem, so the Karush-Kuhn-Tucker optimality condition of the primal problem is changed into a system of equations. We can apply the Newton method to the system of equations.(More)
In this paper, the optimality conditions of semidefinite programming are transformed into an unconstrained optimization problem based on a suitable merit function, which gradient is locally Lipschitz continuous. A modified PRP conjugate gradient method with a new Armijo-type line search is applied to the unconstrained optimization problem. Unlike existing(More)
  • 1