Quadratic Programming with Complementarity Constraints for Multidimensional Scaling with City-Block Distances
نویسندگان
چکیده
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.
منابع مشابه
Multidimensional Scaling with City-Block Distances
Multidimensional scaling is a technique for exploratory analysis of multidimensional data. The essential part of the technique is minimization of a function with unfavorable properties like multimodality, invariants and non-differentiability. Recently various two-level optimization algorithms for multidimensional scaling with city-block distances have been proposed exploiting piecewise quadrati...
متن کاملMultimodal Evolutionary Algorithm for Multidimensional Scaling with City-Block Distances
Multidimensional scaling with city-block distances is considered in this paper. The technique requires optimization of an objective function which has many local minima and can be non-differentiable at minimum points. This study is aimed at developing a fast and effective global optimization algorithm spanning the whole search domain and providing good solutions. A multimodal evolutionary algor...
متن کاملQuadratic Surface Embedding
We discuss various primal and dual algorithms for multidimensional scaling with spherical, ellipsoidal, and more general quadratic constraints. Distances between points on the surface can be either measured along Euclidean lines or along shortest geodesics on the surface.
متن کاملAn inexact block-decomposition method for extra large-scale conic semidefinite programming
In this paper, we present an inexact block-decomposition (BD) first-order method for solving standard form conic semidefinite programming (SDP) which avoids computations of exact projections onto the manifold defined by the affine constraints and, as a result, is able to handle extra large SDP instances. The method is based on a two-block reformulation of the optimality conditions where the fir...
متن کاملParallel Branch and Bound Algorithm for Multidimensional Scaling with City-block Distances
s of MMA2009, May 27 30, 2009, Daugavpils, Latvia c © 2009 PARALLEL BRANCH AND BOUND ALGORITHM FOR MULTIDIMENSIONAL SCALING WITH CITY-BLOCK DISTANCES JULIUS ŽILINSKAS Institute of Mathematics and Informatics Akademijos 4, LT-08663 Vilnius, Lithuania E-mail: [email protected] Multidimensional scaling is a technique for exploratory analysis of multidimensional data widely usable in differ...
متن کامل