{"title":"对称二次线性规划的组合牛顿法","authors":"Xiaoni Chi, Suobin Zhang","doi":"10.1109/ICIC.2011.18","DOIUrl":null,"url":null,"abstract":"We propose a combined Newton method for solving the symmetric conic linear programming based on the Chen-Harker-Kanzow-Smale smoothing function. The proposed algorithm combines the techniques used in both non-smoothing Newton methods and smoothing Newton methods. Under mild assumptions, the algorithm needs to perform at most one line search at each iteration and is shown to possess global convergence.","PeriodicalId":6397,"journal":{"name":"2011 Fourth International Conference on Information and Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2011-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Combined Newton Method for Symmetric Conic Linear Programming\",\"authors\":\"Xiaoni Chi, Suobin Zhang\",\"doi\":\"10.1109/ICIC.2011.18\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose a combined Newton method for solving the symmetric conic linear programming based on the Chen-Harker-Kanzow-Smale smoothing function. The proposed algorithm combines the techniques used in both non-smoothing Newton methods and smoothing Newton methods. Under mild assumptions, the algorithm needs to perform at most one line search at each iteration and is shown to possess global convergence.\",\"PeriodicalId\":6397,\"journal\":{\"name\":\"2011 Fourth International Conference on Information and Computing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-04-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 Fourth International Conference on Information and Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIC.2011.18\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Fourth International Conference on Information and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIC.2011.18","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Combined Newton Method for Symmetric Conic Linear Programming
We propose a combined Newton method for solving the symmetric conic linear programming based on the Chen-Harker-Kanzow-Smale smoothing function. The proposed algorithm combines the techniques used in both non-smoothing Newton methods and smoothing Newton methods. Under mild assumptions, the algorithm needs to perform at most one line search at each iteration and is shown to possess global convergence.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
