Monday, 15:15 - 15:40 h, Room: H 2038

 

Houduo Qi
Computing the nearest Euclidean distance matrix

 

Abstract:
The Nearest Euclidean distance matrix problem (NEDM) is a fundamental computational problem in applications such as multidimensional scaling and molecular conformation from nuclear magnetic resonance data in computational chemistry. Especially in the latter application, the problem is often a large scale with the number of atoms ranging from a few hundreds to a few thousands. In this paper, we introduce a semismooth Newton method that solves the dual problem of (NEDM). We prove that the method is quadratically convergent. We then present an application of the Newton method to NEDM with H-weights via majorization and an accelerated proximal gradient scheme. We demonstrate the superior performance of the Newton method over existing methods including the latest quadratic semi-definite programming solver. This research also opens a new avenue towards efficient solution methods for the molecular embedding problem.

 

Talk 1 of the invited session Mon.3.H 2038
"Matrix optimization" [...]
Cluster 4
"Conic programming" [...]

 

  To apply for Payday Loans In United States you don't have to seek the help of relatives or go to a bank. On the global pharmaceutical market this medicine was issued in 2003 by two companies - Eli Lilly and ICOS. Initially, permission to sell Cheap Cialis was obtained in Europe, Australia, New Zealand.