An Efficient Logarithmic Barrier Method without Line Search for Convex Quadratic Programming

IF 0.4 Q4 MATHEMATICS, APPLIED
S. Chaghoub, D. Benterki
{"title":"An Efficient Logarithmic Barrier Method without Line Search for Convex Quadratic Programming","authors":"S. Chaghoub, D. Benterki","doi":"10.15372/sjnm20220207","DOIUrl":null,"url":null,"abstract":"Abstract In this work, we deal with a convex quadratic problem with inequality constraints. We use a logarithmic barrier method based on some new approximate functions. These functions have the advantage that they allow computing the displacement step easily and without consuming much time, contrarily to the line search method, which is time-consuming and expensive to identify the displacement step. We have developed an implementation with MATLAB and conducted numerical tests on some examples of considerable size. The obtained numerical results show the accuracy and efficiency of our approach.","PeriodicalId":43697,"journal":{"name":"Numerical Analysis and Applications","volume":"15 1","pages":"156-169"},"PeriodicalIF":0.4000,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Numerical Analysis and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15372/sjnm20220207","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

Abstract In this work, we deal with a convex quadratic problem with inequality constraints. We use a logarithmic barrier method based on some new approximate functions. These functions have the advantage that they allow computing the displacement step easily and without consuming much time, contrarily to the line search method, which is time-consuming and expensive to identify the displacement step. We have developed an implementation with MATLAB and conducted numerical tests on some examples of considerable size. The obtained numerical results show the accuracy and efficiency of our approach.
凸二次规划的一种不需要直线搜索的对数屏障法
摘要本文研究了一类具有不等式约束的凸二次型问题。我们使用了一种基于一些新的近似函数的对数屏障方法。这些函数的优点是可以很容易地计算位移步长,并且不需要花费太多的时间,而不是直线搜索方法,这是费时和昂贵的识别位移步长。我们用MATLAB开发了一个实现,并在一些相当大的例子上进行了数值测试。数值结果表明了该方法的准确性和有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Numerical Analysis and Applications
Numerical Analysis and Applications MATHEMATICS, APPLIED-
CiteScore
1.00
自引率
0.00%
发文量
22
期刊介绍: Numerical Analysis and Applications is the translation of Russian periodical Sibirskii Zhurnal Vychislitel’noi Matematiki (Siberian Journal of Numerical Mathematics) published by the Siberian Branch of the Russian Academy of Sciences Publishing House since 1998. The aim of this journal is to demonstrate, in concentrated form, to the Russian and International Mathematical Community the latest and most important investigations of Siberian numerical mathematicians in various scientific and engineering fields. The journal deals with the following topics: Theory and practice of computational methods, mathematical physics, and other applied fields; Mathematical models of elasticity theory, hydrodynamics, gas dynamics, and geophysics; Parallelizing of algorithms; Models and methods of bioinformatics.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信