A hybrid Josephy — Newton method for solving box constrained variational equality roblems via the D-gap function

IF 1.4 3区 数学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Optimization Methods & Software Pub Date : 1999-01-01 DOI:10.1080/10556789908805734
Jiming Peng, Christian Kanzowb, M. Fukushima
{"title":"A hybrid Josephy — Newton method for solving box constrained variational equality roblems via the D-gap function","authors":"Jiming Peng, Christian Kanzowb, M. Fukushima","doi":"10.1080/10556789908805734","DOIUrl":null,"url":null,"abstract":"A box constrained variational inequality problem can be reformulated as an unconstrained minimization problem through the D-gap function. Some basic properties of the affine variational inequality subproblems in the classical Josephy-Newton method are studied. A hybrid Josephy-Newton method is then proposed for minimizing the D-gap function. Under suitable conditions, the algorithm is shown to be globally convergent and locally quadratically convergent. Some numerical results are also presented.","PeriodicalId":54673,"journal":{"name":"Optimization Methods & Software","volume":"3 1","pages":"687-710"},"PeriodicalIF":1.4000,"publicationDate":"1999-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Optimization Methods & Software","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1080/10556789908805734","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 17

Abstract

A box constrained variational inequality problem can be reformulated as an unconstrained minimization problem through the D-gap function. Some basic properties of the affine variational inequality subproblems in the classical Josephy-Newton method are studied. A hybrid Josephy-Newton method is then proposed for minimizing the D-gap function. Under suitable conditions, the algorithm is shown to be globally convergent and locally quadratically convergent. Some numerical results are also presented.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
利用D-gap函数求解盒约束变分等式问题的约瑟夫-牛顿混合方法
盒约束变分不等式问题可以通过D-gap函数重新表述为无约束最小化问题。研究了经典约瑟夫-牛顿方法中仿射变分不等式子问题的一些基本性质。然后提出了一种混合约瑟夫-牛顿法来最小化D-gap函数。在适当的条件下,该算法具有全局收敛性和局部二次收敛性。给出了一些数值结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Optimization Methods & Software
Optimization Methods & Software 工程技术-计算机:软件工程
CiteScore
4.50
自引率
0.00%
发文量
40
审稿时长
7 months
期刊介绍: Optimization Methods and Software publishes refereed papers on the latest developments in the theory and realization of optimization methods, with particular emphasis on the interface between software development and algorithm design. Topics include: Theory, implementation and performance evaluation of algorithms and computer codes for linear, nonlinear, discrete, stochastic optimization and optimal control. This includes in particular conic, semi-definite, mixed integer, network, non-smooth, multi-objective and global optimization by deterministic or nondeterministic algorithms. Algorithms and software for complementarity, variational inequalities and equilibrium problems, and also for solving inverse problems, systems of nonlinear equations and the numerical study of parameter dependent operators. Various aspects of efficient and user-friendly implementations: e.g. automatic differentiation, massively parallel optimization, distributed computing, on-line algorithms, error sensitivity and validity analysis, problem scaling, stopping criteria and symbolic numeric interfaces. Theoretical studies with clear potential for applications and successful applications of specially adapted optimization methods and software to fields like engineering, machine learning, data mining, economics, finance, biology, or medicine. These submissions should not consist solely of the straightforward use of standard optimization techniques.
期刊最新文献
Superlinear convergence of an interior point algorithm on linear semi-definite feasibility problems Automatic source code generation for deterministic global optimization with parallel architectures A neurodynamic approach for a class of pseudoconvex semivectorial bilevel optimization problems An investigation of stochastic trust-region based algorithms for finite-sum minimization A trust-region scheme for constrained multi-objective optimization problems with superlinear convergence property
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1