出版社：Vilnius University, University of Latvia, Latvia University of Agriculture, Institute of Mathematics and Informatics of University of Latvia
摘要：In this paper, we consider an optimization problem arising in multidimensional scaling with city-block distances. The objective function of this problem has many local minimum points and may be even non-differentiable at a minimum point. We reformulate the problem into a problem with convex quadratic objective function, linear and complementarity constraints. In addition, we propose an algorithm to find a local solution of this reformulated problem.
