Reducing large diagonals in kernel matrices through semidefinite programming
نویسندگان
چکیده
!" # $ % & '( *)+ -, .0/ 1 2 435 % 67 98 :;.03 6=< * ># > 8 4 # *, 91 / ? A@( % 2 # CBD 8A'( % ,E F $ > G)0 > H % % I J 8 K L / % / M 0 M8 $ M % 9 L N ! 8 5@( % # OP * ) Q $'( % > ICRS % 8 T)A!" 4 *) / >E > &) > U *) V 8 E/ E !D.0 1;W % YXK > M > :;.0WGXC<U P 1
منابع مشابه
A path following interior-point algorithm for semidefinite optimization problem based on new kernel function
In this paper, we deal to obtain some new complexity results for solving semidefinite optimization (SDO) problem by interior-point methods (IPMs). We define a new proximity function for the SDO by a new kernel function. Furthermore we formulate an algorithm for a primal dual interior-point method (IPM) for the SDO by using the proximity function and give its complexity analysis, and then we sho...
متن کاملAn Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function
In this paper, we consider convex quadratic semidefinite optimization problems and provide a primal-dual Interior Point Method (IPM) based on a new kernel function with a trigonometric barrier term. Iteration complexity of the algorithm is analyzed using some easy to check and mild conditions. Although our proposed kernel function is neither a Self-Regular (SR) fun...
متن کاملMultiple Kernel Learning for Fold Recognition
Fold recognition is a key problem in computational biology that involves classifying protein sharing structural similarities into classes commonly known as “folds”. Recently, researchers have developed several efficient kernel based discriminatory methods for fold classification using sequence information. These methods train one-versus-rest binary classifiers using well optimized kernels from ...
متن کاملSingular value inequalities for positive semidefinite matrices
In this note, we obtain some singular values inequalities for positive semidefinite matrices by using block matrix technique. Our results are similar to some inequalities shown by Bhatia and Kittaneh in [Linear Algebra Appl. 308 (2000) 203-211] and [Linear Algebra Appl. 428 (2008) 2177-2191].
متن کاملNonlinear Dimensionality Reduction by Semidefinite Programming and Kernel Matrix Factorization
We describe an algorithm for nonlinear dimensionality reduction based on semidefinite programming and kernel matrix factorization. The algorithm learns a kernel matrix for high dimensional data that lies on or near a low dimensional manifold. In earlier work, the kernel matrix was learned by maximizing the variance in feature space while preserving the distances and angles between nearest neigh...
متن کامل