发布求助
文献互助 智能选刊 最新文献

Numerical Algebra Control and Optimization最新文献

筛选
英文 中文
A quadrature rule of Lobatto-Gaussian for numerical integration of analytic functions 解析函数数值积分的Lobatto-Gaussian求积分规则
IF 1.3
Numerical Algebra Control and Optimization Pub Date : 2021-01-01 DOI: 10.3934/naco.2021031
Sanjit Kumar Mohanty, R. B. Dash
{"title":"A quadrature rule of Lobatto-Gaussian for numerical integration of analytic functions","authors":"Sanjit Kumar Mohanty, R. B. Dash","doi":"10.3934/naco.2021031","DOIUrl":"https://doi.org/10.3934/naco.2021031","url":null,"abstract":"A novel quadrature rule is formed combining Lobatto six point transformed rule and Gauss-Legendre five point transformed rule each having precision nine. The mixed rule so formed is of precision eleven. Through asymptotic error estimation the novelty of the quadrature rule is justified. Some test integrals have been evaluated using the mixed rule and its constituents both in non-adaptive and adaptive modes. The results are found to be quite encouraging for the mixed rule which is in conformation with the theoretical prediction.","PeriodicalId":44957,"journal":{"name":"Numerical Algebra Control and Optimization","volume":null,"pages":null},"PeriodicalIF":1.3,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78230084","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Modified Dai-Yuan iterative scheme for Nonlinear Systems and its Application 非线性系统的改进Dai-Yuan迭代格式及其应用
IF 1.3
Numerical Algebra Control and Optimization Pub Date : 2021-01-01 DOI: 10.3934/naco.2021044
M. Waziri, K. Ahmed, A. Halilu, Aliyu Mohammed Awwal
{"title":"Modified Dai-Yuan iterative scheme for Nonlinear Systems and its Application","authors":"M. Waziri, K. Ahmed, A. Halilu, Aliyu Mohammed Awwal","doi":"10.3934/naco.2021044","DOIUrl":"https://doi.org/10.3934/naco.2021044","url":null,"abstract":"By exploiting the idea employed in the spectral Dai-Yuan method by Xue et al. [IEICE Trans. Inf. Syst. 101 (12)2984-2990 (2018)] and the approach applied in the modified Hager-Zhang scheme for nonsmooth optimization [PLos ONE 11(10): e0164289 (2016)], we develop a Dai-Yuan type iterative scheme for convex constrained nonlinear monotone system. The scheme's algorithm is obtained by combining its search direction with the projection method [Kluwer Academic Publishers, pp. 355-369(1998)]. One of the new scheme's attribute is that it is derivative-free, which makes it ideal for solving non-smooth problems. Furthermore, we demonstrate the method's application in image de-blurring problems by comparing its performance with a recent effective method. By employing mild assumptions, global convergence of the scheme is determined and results of some numerical experiments show the method to be favorable compared to some recent iterative methods.","PeriodicalId":44957,"journal":{"name":"Numerical Algebra Control and Optimization","volume":null,"pages":null},"PeriodicalIF":1.3,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74668339","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
Individual biometrics pattern based artificial image analysis techniques 基于个体生物特征模式的人工图像分析技术
IF 1.3
Numerical Algebra Control and Optimization Pub Date : 2021-01-01 DOI: 10.3934/NACO.2020056
Israa Mohammed Khudher, Y. Ibrahim, S. A. Altamir
{"title":"Individual biometrics pattern based artificial image analysis techniques","authors":"Israa Mohammed Khudher, Y. Ibrahim, S. A. Altamir","doi":"10.3934/NACO.2020056","DOIUrl":"https://doi.org/10.3934/NACO.2020056","url":null,"abstract":"Biometric characteristics have been used since antiquated decades, particularly in the detection of crimes and investigations. The rapid development in image processing made great progress in biometric features recognition that is used in all life directions, especially when these features recognition is constructed as a computer system. The target of this research is to set up a left foot biometric system by hybridization between image processing and artificial bee colony (ABC) for feature choice that is addressed within artificial image processing. The algorithm is new because of the rare availability of hybridization algorithms in the literature of footprint recognition with the artificial bee colony assessment. The suggested system is tested on a live-captured ninety colored footprint images that composed the visual database. Then the constructed database was classified into nine clusters and normalized to be used at the advanced stages. Features database is constructed from the visual database off-line. The system starts with a comparison operation between the foot-tip image features extracted on-line and the visual database features. The outcome from this process is either a reject or an acceptance message. The results of the proposed work reflect the accuracy and integrity of the output. That is affected by the perfect choice of features as well as the use of artificial bee colony and data clustering which decreased the complexity and later raised the recognition rate to 100%. Our outcomes show the precision of our proposed procedures over others' methods in the field of biometric acknowledgment.","PeriodicalId":44957,"journal":{"name":"Numerical Algebra Control and Optimization","volume":null,"pages":null},"PeriodicalIF":1.3,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74670885","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Application of survival theory in Mining industry 生存理论在矿业中的应用
IF 1.3
Numerical Algebra Control and Optimization Pub Date : 2021-01-01 DOI: 10.3934/naco.2020036
E. Rentsen, N. Tungalag, J. Enkhbayar, O. Battogtokh, L. Enkhtuvshin
{"title":"Application of survival theory in Mining industry","authors":"E. Rentsen, N. Tungalag, J. Enkhbayar, O. Battogtokh, L. Enkhtuvshin","doi":"10.3934/naco.2020036","DOIUrl":"https://doi.org/10.3934/naco.2020036","url":null,"abstract":"The paper deals with an application of survival theory in mineral processing industry. We consider the problem of maximizing copper recovery and determine the best operating conditions based on survival theory. The survival of the system reduces to a problem of maximizing a radius of a sphere inscribed into a polyhedral set defined by the linear regression equations for a flotation process. To demonstrate the effectiveness of the proposed approach, we present a case study for the rougher flotation process of copper-molybdenum ores performed at the Erdenet Mining Corporation(Mongolia).","PeriodicalId":44957,"journal":{"name":"Numerical Algebra Control and Optimization","volume":null,"pages":null},"PeriodicalIF":1.3,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73147731","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Smooth augmented lagrangian method for twin bounded support vector machine 双有界支持向量机的光滑增广拉格朗日方法
IF 1.3
Numerical Algebra Control and Optimization Pub Date : 2021-01-01 DOI: 10.3934/naco.2021027
F. Bazikar, S. Ketabchi, H. Moosaei
{"title":"Smooth augmented lagrangian method for twin bounded support vector machine","authors":"F. Bazikar, S. Ketabchi, H. Moosaei","doi":"10.3934/naco.2021027","DOIUrl":"https://doi.org/10.3934/naco.2021027","url":null,"abstract":"In this paper, we propose a method for solving the twin bounded support vector machine (TBSVM) for the binary classification. To do so, we use the augmented Lagrangian (AL) optimization method and smoothing technique, to obtain new unconstrained smooth minimization problems for TBSVM classifiers. At first, the augmented Lagrangian method is recruited to convert TBSVM into unconstrained minimization programming problems called as AL-TBSVM. We attempt to solve the primal programming problems of AL-TBSVM by converting them into smooth unconstrained minimization problems. Then, the smooth reformulations of AL-TBSVM, which we called AL-STBSVM, are solved by the well-known Newton's algorithm. Finally, experimental results on artificial and several University of California Irvine (UCI) benchmark data sets are provided along with the statistical analysis to show the superior performance of our method in terms of classification accuracy and learning speed.","PeriodicalId":44957,"journal":{"name":"Numerical Algebra Control and Optimization","volume":null,"pages":null},"PeriodicalIF":1.3,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73712819","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
An inexact alternating direction method of multipliers for a kind of nonlinear complementarity problems 一类非线性互补问题的乘法器的不精确交替方向法
IF 1.3
Numerical Algebra Control and Optimization Pub Date : 2021-01-01 DOI: 10.3934/naco.2020030
Jiewen He, Chi Lei, Chenyang Shi, Seakweng Vong
{"title":"An inexact alternating direction method of multipliers for a kind of nonlinear complementarity problems","authors":"Jiewen He, Chi Lei, Chenyang Shi, Seakweng Vong","doi":"10.3934/naco.2020030","DOIUrl":"https://doi.org/10.3934/naco.2020030","url":null,"abstract":"Many kinds of practical problems can be formulated as nonlinear complementarity problems. In this paper, an inexact alternating direction method of multipliers for the solution of a kind of nonlinear complementarity problems is proposed. The convergence analysis of the method is given. Numerical results confirm the theoretical analysis, and show that the proposed method can be more efficient and faster than the modulus-based Jacobi, Gauss-Seidel and Successive Overrelaxation method when the dimension of the problem being solved is large.","PeriodicalId":44957,"journal":{"name":"Numerical Algebra Control and Optimization","volume":null,"pages":null},"PeriodicalIF":1.3,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84801667","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
$ V $-$ E $-invexity in $ E $-differentiable multiobjective programming $ E $-可微多目标规划中的$ V $-$ E $-幂幂性
IF 1.3
Numerical Algebra Control and Optimization Pub Date : 2021-01-01 DOI: 10.3934/NACO.2021014
Najeeb Abdulaleem
{"title":"$ V $-$ E $-invexity in $ E $-differentiable multiobjective programming","authors":"Najeeb Abdulaleem","doi":"10.3934/NACO.2021014","DOIUrl":"https://doi.org/10.3934/NACO.2021014","url":null,"abstract":"In this paper, a new concept of generalized convexity is introduced for not necessarily differentiable vector optimization problems with begin{document}$ E $end{document} -differentiable functions. Namely, for an begin{document}$ E $end{document} -differentiable vector-valued function, the concept of begin{document}$ V $end{document} - begin{document}$ E $end{document} -invexity is defined as a generalization of the begin{document}$ E $end{document} -differentiable begin{document}$ E $end{document} -invexity notion and the concept of begin{document}$ V $end{document} -invexity. Further, the sufficiency of the so-called begin{document}$ E $end{document} -Karush-Kuhn-Tucker optimality conditions are established for the considered begin{document}$ E $end{document} -differentiable vector optimization problems with both inequality and equality constraints under begin{document}$ V $end{document} - begin{document}$ E $end{document} -invexity hypotheses. Furthermore, the so-called vector begin{document}$ E $end{document} -dual problem in the sense of Mond-Weir is defined for the considered begin{document}$ E $end{document} -differentiable multiobjective programming problem and several begin{document}$ E $end{document} -duality theorems are derived also under appropriate begin{document}$ V $end{document} - begin{document}$ E $end{document} -invexity assumptions.","PeriodicalId":44957,"journal":{"name":"Numerical Algebra Control and Optimization","volume":null,"pages":null},"PeriodicalIF":1.3,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82092705","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Examination of solving optimal control problems with delays using GPOPS-Ⅱ 用GPOPS-Ⅱ求解时滞最优控制问题的检验
IF 1.3
Numerical Algebra Control and Optimization Pub Date : 2021-01-01 DOI: 10.3934/naco.2020026
J. Betts, S. Campbell, Claire Digirolamo
{"title":"Examination of solving optimal control problems with delays using GPOPS-Ⅱ","authors":"J. Betts, S. Campbell, Claire Digirolamo","doi":"10.3934/naco.2020026","DOIUrl":"https://doi.org/10.3934/naco.2020026","url":null,"abstract":"There are a limited number of user-friendly, publicly available optimal control software packages that are designed to accommodate problems with delays. GPOPS-Ⅱ is a well developed MATLAB based optimal control code that was not originally designed to accommodate problems with delays. The use of GPOPS-Ⅱ on optimal control problems with delays is examined for the first time. The use of various formulations of delayed optimal control problems is also discussed. It is seen that GPOPS-Ⅱ finds a suboptimal solution when used as a direct transcription delayed optimal control problem solver but that it is often able to produce a good solution of the optimal control problem when used as a delayed boundary value solver of the necessary conditions.","PeriodicalId":44957,"journal":{"name":"Numerical Algebra Control and Optimization","volume":null,"pages":null},"PeriodicalIF":1.3,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81564254","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
A mesh adaptation algorithm using new monitor and estimator function for discontinuous and layered solution 一种基于监测和估计函数的网格自适应算法
IF 1.3
Numerical Algebra Control and Optimization Pub Date : 2021-01-01 DOI: 10.3934/naco.2021029
Prabhat Mishra, Vikas Gupta, R. Dubey
{"title":"A mesh adaptation algorithm using new monitor and estimator function for discontinuous and layered solution","authors":"Prabhat Mishra, Vikas Gupta, R. Dubey","doi":"10.3934/naco.2021029","DOIUrl":"https://doi.org/10.3934/naco.2021029","url":null,"abstract":"In this work a novel mesh adaptation technique is proposed to approximate discontinuous or boundary layer solution of partial differential equations. We introduce new estimator and monitor function to detect solution region containing discontinuity and layered region. Subsequently, this information is utilized along with equi-distribution principle to adapt the mesh locally. Numerical tests for numerous scalar problems are presented. These results clearly demonstrate the robustness of this method and non-oscillatory nature of the computed solutions.","PeriodicalId":44957,"journal":{"name":"Numerical Algebra Control and Optimization","volume":null,"pages":null},"PeriodicalIF":1.3,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86425817","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Triple-hierarchical problems with variational inequality 具有变分不等式的三层次问题
IF 1.3
Numerical Algebra Control and Optimization Pub Date : 2021-01-01 DOI: 10.3934/naco.2021038
Thanyarat Jitpeera, Tamaki Tanaka, P. Kumam
{"title":"Triple-hierarchical problems with variational inequality","authors":"Thanyarat Jitpeera, Tamaki Tanaka, P. Kumam","doi":"10.3934/naco.2021038","DOIUrl":"https://doi.org/10.3934/naco.2021038","url":null,"abstract":"<p style='text-indent:20px;'>In this paper, we suggest and analyze an iterative scheme for finding the triple-hierarchical problem in a real Hilbert space. We also consider the strong convergence for the proposed method under some assumptions. Our results extend ones of Ceng et. al (2011) [<xref ref-type=\"bibr\" rid=\"b2\">2</xref>], Yao et. al (2011) [<xref ref-type=\"bibr\" rid=\"b24\">24</xref>].</p>","PeriodicalId":44957,"journal":{"name":"Numerical Algebra Control and Optimization","volume":null,"pages":null},"PeriodicalIF":1.3,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88718690","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信