A new double trust regions SQP method without a penalty function or a filter

IF 2.5 3区 数学 Q1 MATHEMATICS, APPLIED Computational & Applied Mathematics Pub Date : 2012-08-28 DOI:10.1590/S1807-03022012000200011
Xiaojing Zhu, D. Pu
{"title":"A new double trust regions SQP method without a penalty function or a filter","authors":"Xiaojing Zhu, D. Pu","doi":"10.1590/S1807-03022012000200011","DOIUrl":null,"url":null,"abstract":"A new trust-region SQP method for equality constrained optimization is considered. This method avoids using a penalty function or a filter, and yet can be globally convergent to first-order critical points under some reasonable assumptions. Each SQP step is composed of a normal step and a tangential step for which different trust regions are applied in the spirit of Gould and Toint [Math. Program., 122 (2010), pp. 155-196]. Numerical results demonstrate that this new approach is potentially useful. Mathematical subject classification: 65K05, 90C30, 90C55.","PeriodicalId":50649,"journal":{"name":"Computational & Applied Mathematics","volume":null,"pages":null},"PeriodicalIF":2.5000,"publicationDate":"2012-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computational & Applied Mathematics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1590/S1807-03022012000200011","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 2

Abstract

A new trust-region SQP method for equality constrained optimization is considered. This method avoids using a penalty function or a filter, and yet can be globally convergent to first-order critical points under some reasonable assumptions. Each SQP step is composed of a normal step and a tangential step for which different trust regions are applied in the spirit of Gould and Toint [Math. Program., 122 (2010), pp. 155-196]. Numerical results demonstrate that this new approach is potentially useful. Mathematical subject classification: 65K05, 90C30, 90C55.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种新的不带惩罚函数和过滤器的双信任域SQP方法
提出了求解等式约束优化问题的一种新的信任域SQP方法。该方法避免了使用惩罚函数或滤波器,并且在合理的假设下可以全局收敛到一阶临界点。每个SQP步骤由一个正规步骤和一个切向步骤组成,根据Gould和Toint [Math]的精神,对这些步骤应用不同的信任区域。程序。, 122 (2010), pp. 155-196]。数值结果表明,该方法具有潜在的实用价值。数学学科分类:65K05、90C30、90C55。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Computational & Applied Mathematics
Computational & Applied Mathematics Mathematics-Computational Mathematics
CiteScore
4.50
自引率
11.50%
发文量
352
审稿时长
>12 weeks
期刊介绍: Computational & Applied Mathematics began to be published in 1981. This journal was conceived as the main scientific publication of SBMAC (Brazilian Society of Computational and Applied Mathematics). The objective of the journal is the publication of original research in Applied and Computational Mathematics, with interfaces in Physics, Engineering, Chemistry, Biology, Operations Research, Statistics, Social Sciences and Economy. The journal has the usual quality standards of scientific international journals and we aim high level of contributions in terms of originality, depth and relevance.
期刊最新文献
A numerical investigation with energy-preservation for nonlinear space-fractional Klein–Gordon–Schrödinger system A posteriori error estimates of a DG method for optimal control problems governed by the transport equation A diagonally scaled Newton-type proximal method for minimization of the models with nonsmooth composite cost functions Two general splitting methods with alternated inertia for solving split equality problem in Hilbert spaces On $$(G_O,O)-$$fuzzy rough sets based on overlap and grouping functions over complete lattices
×
引用
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