-

 

 

 




Optimization Online





 

On the implementation and usage of SDPT3 -- a Matlab software package for semidefinite-quadratic-linear programming, version 4.0

Kim-Chuan Toh(mattohkc***at***nus.edu.sg)
Michael J. Todd(miketodd***at***cs.cornell.edu)
Reha H. Tutuncu(reha.tutuncu***at***gs.com)

Abstract: This software is designed to solve primal and dual semidefinite-quadratic-linear conic programming problems (known as SQLP problems) whose constraint cone is a product of semidefinite cones, second-order cones, nonnegative orthants and Euclidean spaces, and whose objective function is the sum of linear functions and log-barrier terms associated with the constraint cones. This includes the special case of determinant maximization problems with linear matrix inequalities. It employs an infeasible primal-dual predictor-corrector path-following method, with either the HKM or the NT search direction. The basic code is written in {\sc Matlab}, but key subroutines in C are incorporated via Mex files. Routines are provided to read in problems in either SDPA or SeDuMi format. Sparsity and block diagonal structure are exploited. We also exploit low-rank structures in the constraint matrices associated with the semidefinite blocks if such structures are explicitly given. To help the users in using our software, we also include some examples to illustrate the coding of problem data for our solver. Various techniques to improve the efficiency and robustness of the main solver are incorporated. For example, step-lengths associated with semidefinite cones are calculated via the Lanczos method. The current version also implements algorithms for solving a 3-parameter homogeneous self-dual model of the primal and dual SQLP problems. Routines are also provided to determine whether the primal and dual feasible regions of a given SQLP have empty interiors. Numerical experiments show that this general-purpose code can solve more than 80\% of a total of about {430} test problems to an accuracy of at least $10^{-6}$ in relative duality gap and infeasibilities.

Keywords:

Category 1: Linear, Cone and Semidefinite Programming

Category 2: Optimization Software and Modeling Systems

Citation: Preprint, National University of Singapore, June, 2010.

Download: [PDF]

Entry Submitted: 06/16/2010
Entry Accepted: 06/16/2010
Entry Last Modified: 06/16/2010

Modify/Update this entry


  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository

 

Submit
Update
Policies
Coordinator's Board
Classification Scheme
Credits
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society