Quadratic Programming with Complementarity Constraints for Multidimensional Scaling with City-Block Distances

被引:0
|
作者
Fletcher, Roger [1 ]
Galiauskas, Nerijus [2 ]
Zilinskas, Julius [2 ]
机构
[1] Univ Dundee, Dept Math, Dundee DD1 4HN, Scotland
[2] Vilnius Univ, Inst Math & Informat, LT-08663 Vilnius, Lithuania
来源
BALTIC JOURNAL OF MODERN COMPUTING | 2014年 / 2卷 / 04期
关键词
multidimensional scaling; city-block distances; quadratic programming; active-set method;
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
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, propose an algorithm to find a local solution of this reformulated problem.
引用
收藏
页码:248 / 259
页数:12
相关论文
共 33 条