Learn More
We present an interior proximal point method with Bregman distance, whose Bregman function is separable and the zone is the interior of the positive or-thant, for solving the quasiconvex optimization problem under nonnegative constraints. We establish that the sequence generated by our algorithm is well defined and we prove convergence to a solution point(More)
  • 1