-HLCP的Mehrotra型预测校正内点法

IF 1.4 4区数学 Q2 MATHEMATICS, APPLIED Numerical Functional Analysis and Optimization Pub Date : 2022-09-21 DOI:10.1080/01630563.2022.2123818

N. Hazzam, Z. Kebbiche

{"title":"-HLCP的Mehrotra型预测校正内点法","authors":"N. Hazzam, Z. Kebbiche","doi":"10.1080/01630563.2022.2123818","DOIUrl":null,"url":null,"abstract":"Abstract In this article, a new variant of Mehrotra type-predictor-corrector algorithm is proposed for -horizontal linear complementarity problem. We demonstrate the theoretical efficiency of this algorithm by showing its polynomial complexity. The iteration bound is given by We test the practical efficiency and the validity of our algorithm by running some computational tests.","PeriodicalId":54707,"journal":{"name":"Numerical Functional Analysis and Optimization","volume":"43 1","pages":"1647 - 1659"},"PeriodicalIF":1.4000,"publicationDate":"2022-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Mehrotra Type Predictor-Corrector Interior-Point Method for -HLCP\",\"authors\":\"N. Hazzam, Z. Kebbiche\",\"doi\":\"10.1080/01630563.2022.2123818\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract In this article, a new variant of Mehrotra type-predictor-corrector algorithm is proposed for -horizontal linear complementarity problem. We demonstrate the theoretical efficiency of this algorithm by showing its polynomial complexity. The iteration bound is given by We test the practical efficiency and the validity of our algorithm by running some computational tests.\",\"PeriodicalId\":54707,\"journal\":{\"name\":\"Numerical Functional Analysis and Optimization\",\"volume\":\"43 1\",\"pages\":\"1647 - 1659\"},\"PeriodicalIF\":1.4000,\"publicationDate\":\"2022-09-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Numerical Functional Analysis and Optimization\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1080/01630563.2022.2123818\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Numerical Functional Analysis and Optimization","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1080/01630563.2022.2123818","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}

引用次数: 0

摘要

摘要本文针对水平线性互补问题，提出了一种新的Mehrotra型预测校正算法。我们通过展示该算法的多项式复杂性来证明其理论效率。迭代界由给出。我们通过运行一些计算测试来测试算法的实际效率和有效性。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

A Mehrotra Type Predictor-Corrector Interior-Point Method for -HLCP

Abstract In this article, a new variant of Mehrotra type-predictor-corrector algorithm is proposed for -horizontal linear complementarity problem. We demonstrate the theoretical efficiency of this algorithm by showing its polynomial complexity. The iteration bound is given by We test the practical efficiency and the validity of our algorithm by running some computational tests.

求助全文

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

来源期刊

Numerical Functional Analysis and Optimization 数学-应用数学

CiteScore

2.40

自引率

8.30%

发文量

审稿时长

6-12 weeks

期刊介绍： Numerical Functional Analysis and Optimization is a journal aimed at development and applications of functional analysis and operator-theoretic methods in numerical analysis, optimization and approximation theory, control theory, signal and image processing, inverse and ill-posed problems, applied and computational harmonic analysis, operator equations, and nonlinear functional analysis. Not all high-quality papers within the union of these fields are within the scope of NFAO. Generalizations and abstractions that significantly advance their fields and reinforce the concrete by providing new insight and important results for problems arising from applications are welcome. On the other hand, technical generalizations for their own sake with window dressing about applications, or variants of known results and algorithms, are not suitable for this journal. Numerical Functional Analysis and Optimization publishes about 70 papers per year. It is our current policy to limit consideration to one submitted paper by any author/co-author per two consecutive years. Exception will be made for seminal papers.