Convex Perturbations for Scalable Semidefinite Programming
暂无分享,去创建一个
[1] Pietro Perona,et al. Learning Generative Visual Models from Few Training Examples: An Incremental Bayesian Approach Tested on 101 Object Categories , 2004, 2004 Conference on Computer Vision and Pattern Recognition Workshop.
[2] Andrzej Stachurski,et al. Parallel Optimization: Theory, Algorithms and Applications , 2000, Scalable Comput. Pract. Exp..
[3] Inderjit S. Dhillon,et al. Information-theoretic metric learning , 2006, ICML '07.
[4] Sanjoy Dasgupta,et al. Robust Euclidean embedding , 2006, ICML.
[5] B. Martinet,et al. R'egularisation d''in'equations variationnelles par approximations successives , 1970 .
[6] Paul Tseng. Convergence and Error Bound for Perturbation of Linear Programs , 1999, Comput. Optim. Appl..
[7] Lorenzo Torresani,et al. Large Margin Component Analysis , 2006, NIPS.
[8] Kilian Q. Weinberger,et al. Fast solvers and efficient implementations for distance metric learning , 2008, ICML '08.
[9] Yurii Nesterov,et al. Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.
[10] Jitendra Malik,et al. SVM-KNN: Discriminative Nearest Neighbor Classification for Visual Category Recognition , 2006, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06).
[11] O. Mangasarian. Normal solutions of linear programs , 1984 .
[12] O. Mangasarian,et al. NONLINEAR PERTURBATION OF LINEAR PROGRAMS , 1979 .
[13] Kilian Q. Weinberger,et al. Learning a kernel matrix for nonlinear dimensionality reduction , 2004, ICML.
[14] Tommi S. Jaakkola,et al. Maximum-Margin Matrix Factorization , 2004, NIPS.
[15] Kilian Q. Weinberger,et al. Distance Metric Learning for Large Margin Nearest Neighbor Classification , 2005, NIPS.
[16] Lawrence K. Saul,et al. Analysis and extension of spectral methods for nonlinear dimensionality reduction , 2005, ICML.
[17] Nello Cristianini,et al. Learning the Kernel Matrix with Semidefinite Programming , 2002, J. Mach. Learn. Res..
[18] Kevin J. Lang. Fixing two weaknesses of the Spectral Method , 2005, NIPS.
[19] R. Rockafellar. Monotone Operators and the Proximal Point Algorithm , 1976 .
[20] Marc Teboulle,et al. Interior Gradient and Proximal Methods for Convex and Conic Optimization , 2006, SIAM J. Optim..
[21] Renato D. C. Monteiro,et al. A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization , 2003, Math. Program..
[22] Boonserm Kijsirikul,et al. On Kernelization of Supervised Mahalanobis Distance Learners , 2008, ArXiv.
[23] Xiong Zhang,et al. Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization , 1999, SIAM J. Optim..
[24] Franz Rendl,et al. A Spectral Bundle Method for Semidefinite Programming , 1999, SIAM J. Optim..
[25] Farid Alizadeh,et al. Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization , 1995, SIAM J. Optim..
[26] Paul Tseng,et al. Exact Regularization of Convex Programs , 2007, SIAM J. Optim..
[27] Pietro Perona,et al. Learning Generative Visual Models from Few Training Examples: An Incremental Bayesian Approach Tested on 101 Object Categories , 2004, 2004 Conference on Computer Vision and Pattern Recognition Workshop.
[28] Michael C. Ferris,et al. Finite perturbation of convex programs , 1991 .