基于简单核函数的二阶锥规划的内点法

2010 Second International Conference on Computational Intelligence and Natural Computing Pub Date : 2010-11-22 DOI:10.1109/CINC.2010.5643888

Li Dong, Jingyong Tang

{"title":"基于简单核函数的二阶锥规划的内点法","authors":"Li Dong, Jingyong Tang","doi":"10.1109/CINC.2010.5643888","DOIUrl":null,"url":null,"abstract":"Interior-point methods not only are the most effective methods in practice but also have polynomial-time complexity. In this paper we present a primal-dual interiorpoint algorithm for second-order cone programming problems based on a simple kernel function. We derive the iteration bounds O(nlogε/n over n) and O(√nlogε/n over n) for large- and small-update methods, respectively, which are as good as those in the linear programming.","PeriodicalId":227004,"journal":{"name":"2010 Second International Conference on Computational Intelligence and Natural Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2010-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Interior-point method for second-order cone programming based on a simple kernel function\",\"authors\":\"Li Dong, Jingyong Tang\",\"doi\":\"10.1109/CINC.2010.5643888\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Interior-point methods not only are the most effective methods in practice but also have polynomial-time complexity. In this paper we present a primal-dual interiorpoint algorithm for second-order cone programming problems based on a simple kernel function. We derive the iteration bounds O(nlogε/n over n) and O(√nlogε/n over n) for large- and small-update methods, respectively, which are as good as those in the linear programming.\",\"PeriodicalId\":227004,\"journal\":{\"name\":\"2010 Second International Conference on Computational Intelligence and Natural Computing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-11-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 Second International Conference on Computational Intelligence and Natural Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CINC.2010.5643888\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Second International Conference on Computational Intelligence and Natural Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CINC.2010.5643888","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

内点法是实践中最有效的方法，但具有多项式的时间复杂度。本文提出了一种基于简单核函数的二阶锥规划问题的原-对偶内点算法。我们分别导出了大更新方法和小更新方法的迭代界O(nlogε/n /n)和O(√nlogε/n /n)，它们与线性规划中的迭代界一样好。

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

查看原文本刊更多论文

Interior-point method for second-order cone programming based on a simple kernel function

Interior-point methods not only are the most effective methods in practice but also have polynomial-time complexity. In this paper we present a primal-dual interiorpoint algorithm for second-order cone programming problems based on a simple kernel function. We derive the iteration bounds O(nlogε/n over n) and O(√nlogε/n over n) for large- and small-update methods, respectively, which are as good as those in the linear programming.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2010 Second International Conference on Computational Intelligence and Natural Computing

自引率

0.00%

发文量