We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn 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