On the implementation of SDPT3 (version 3.1) - a MATLAB software package for semidefinite-quadratic-linear programming

2004 IEEE International Conference on Robotics and Automation (IEEE Cat. No.04CH37508) Pub Date : 2004-09-02 DOI:10.1109/CACSD.2004.1393891

K. Toh, R. Tütüncü, M. Todd

{"title":"On the implementation of SDPT3 (version 3.1) - a MATLAB software package for semidefinite-quadratic-linear programming","authors":"K. Toh, R. Tütüncü, M. Todd","doi":"10.1109/CACSD.2004.1393891","DOIUrl":null,"url":null,"abstract":"This code is designed to solve conic programming problems whose constraint cone is a product of semidefinite cones, second-order cones, nonnegative orthants and Euclidean spaces. It employs a primal-dual predictor-corrector path-following method, with either the HKM or the NT search direction. The basic code is written in MATLAB, but key subroutines in Fortran and C are incorporated via a Mex interface. Routines are provided to read in problems in either SDPA or SeDuMi format. Sparsity and block diagonal structure are exploited, but the latter needs to be given explicitly or detected via a subroutine that is provided. Various techniques to improve the efficiency and stablity of the algorithm are incorporated. For example, step-lengths associated with semidefinite cones are calculated via the Lanczos method. Numerical experiments show that this general purpose code can solve 80% of a total of about 300 problems to an accuracy of at least 10-6 in relative duality gap and infeasibilities","PeriodicalId":111199,"journal":{"name":"2004 IEEE International Conference on Robotics and Automation (IEEE Cat. No.04CH37508)","volume":"91 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"46","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2004 IEEE International Conference on Robotics and Automation (IEEE Cat. No.04CH37508)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CACSD.2004.1393891","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 46

Abstract

This code is designed to solve conic programming problems whose constraint cone is a product of semidefinite cones, second-order cones, nonnegative orthants and Euclidean spaces. It employs a primal-dual predictor-corrector path-following method, with either the HKM or the NT search direction. The basic code is written in MATLAB, but key subroutines in Fortran and C are incorporated via a Mex interface. Routines are provided to read in problems in either SDPA or SeDuMi format. Sparsity and block diagonal structure are exploited, but the latter needs to be given explicitly or detected via a subroutine that is provided. Various techniques to improve the efficiency and stablity of the algorithm are incorporated. For example, step-lengths associated with semidefinite cones are calculated via the Lanczos method. Numerical experiments show that this general purpose code can solve 80% of a total of about 300 problems to an accuracy of at least 10-6 in relative duality gap and infeasibilities

查看原文本刊更多论文

关于SDPT3(3.1版)的实现-一个半定二次线性规划的MATLAB软件包

该程序用于求解约束锥是半定锥、二阶锥、非负对角和欧氏空间乘积的二次规划问题。它采用原始对偶预测校正路径跟踪方法，使用HKM或NT搜索方向。基本代码是用MATLAB编写的，但关键的子程序是通过一个Mex接口用Fortran和C编写的。提供了SDPA或SeDuMi格式的例程来读入问题。稀疏性和块对角结构被利用，但后者需要显式给定或通过提供的子例程检测。采用了各种技术来提高算法的效率和稳定性。例如，通过Lanczos方法计算与半定锥相关的步长。数值实验表明，该通用代码可以解决总共约300个问题中的80%，在相对对偶差距和不可行性方面的精度至少为10-6

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

2004 IEEE International Conference on Robotics and Automation (IEEE Cat. No.04CH37508)

自引率

0.00%

发文量