An Efficient Approach to Solve the Large-Scale Semidefinite Programming Problems

Solving the large-scale problems with semidefinite programming (SDP) constraints is of great importance in modeling and model reduction of complex system, dynamical system, optimal control, computer vision, and machine learning. However, existing SDP solvers are of large complexities and thus unavailable to deal with large-scale problems. In this paper, we solve SDP using matrix generation, which is an extension of the classical column generation. The exponentiated gradient algorithm is also used to solve the special structure subproblem of matrix generation. The numerical experiments show that our approach is efficient and scales very well with the problem dimension. Furthermore, the proposed algorithm is applied for a clustering problem. The experimental results on real datasets imply that the proposed approach outperforms the traditional interior-point SDP solvers in terms of efficiency and scalability.

[1]  Jiming Peng,et al.  Advanced Optimization Laboratory Title : Approximating K-means-type clustering via semidefinite programming , 2005 .

[2]  Shengyong Chen,et al.  Parametric Shape Representation by a Deformable NURBS Model for Cardiac Functional Measurements , 2011, IEEE Transactions on Biomedical Engineering.

[3]  Chunhua Shen,et al.  LACBoost and FisherBoost: Optimally Building Cascade Classifiers , 2010, ECCV.

[4]  Aivar Sootla Model Reduction Using Semidefinite Programming , 2009 .

[5]  Jianwei Zhang,et al.  Vision Processing for Realtime 3-D Data Acquisition Based on Coded Structured Light , 2008, IEEE Transactions on Image Processing.

[6]  Amnon Shashua,et al.  Doubly Stochastic Normalization for Spectral Clustering , 2006, NIPS.

[7]  Jacques Desrosiers,et al.  Selected Topics in Column Generation , 2002, Oper. Res..

[8]  Lei Wang,et al.  PSDBoost: Matrix-Generation Linear Programming for Positive Semidefinite Matrices Learning , 2008, NIPS.

[9]  Yan Li,et al.  Compact Modeling of Nonlinear Analog Circuits Using System Identification via Semidefinite Programming and Incremental Stability Certification , 2009, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[10]  Marc Teboulle,et al.  Mirror descent and nonlinear projected subgradient methods for convex optimization , 2003, Oper. Res. Lett..

[11]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[12]  Kim-Chuan Toh,et al.  Solving semidefinite-quadratic-linear programs using SDPT3 , 2003, Math. Program..

[13]  Manfred K. Warmuth,et al.  Additive versus exponentiated gradient updates for linear prediction , 1995, STOC '95.

[14]  Alexandre Megretski,et al.  Passive reduced order modeling of multiport interconnects via semidefinite programming , 2010, 2010 Design, Automation & Test in Europe Conference & Exhibition (DATE 2010).

[15]  Stephen P. Boyd,et al.  Graph Implementations for Nonsmooth Convex Programs , 2008, Recent Advances in Learning and Control.

[16]  I Mitrani,et al.  A semidefinite programming approach to the optimal control of a single server queueing system with imposed second moment constraints , 1999, J. Oper. Res. Soc..

[17]  Ming Li,et al.  Exact Solution of Impulse Response to a Class of Fractional Oscillators and Its Stability , 2011 .

[18]  Shengyong Chen,et al.  Vision sensor planning for 3-D model acquisition , 2005, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[19]  Xavier Carreras,et al.  Exponentiated gradient algorithms for log-linear structured prediction , 2007, ICML '07.

[20]  Sanjoy Dasgupta,et al.  Robust Euclidean embedding , 2006, ICML.

[21]  Nello Cristianini,et al.  Learning the Kernel Matrix with Semidefinite Programming , 2002, J. Mach. Learn. Res..

[22]  Manfred K. Warmuth,et al.  Exponentiated Gradient Versus Gradient Descent for Linear Predictors , 1997, Inf. Comput..

[23]  John C. Platt,et al.  Fast Low-Rank Semidefinite Programming for Embedding and Clustering , 2007, AISTATS.