{"title":"A Stabilized Sequential Quadratic Programming Method for Optimization Problems in Function Spaces","authors":"Yuya Yamakawa","doi":"10.1080/01630563.2023.2178009","DOIUrl":null,"url":null,"abstract":"Abstract In this paper, we propose a stabilized sequential quadratic programming (SQP) method for optimization problems in function spaces. A form of the problem considered in this paper can widely formulate many types of applications, such as obstacle problems, optimal control problems, and so on. Moreover, the proposed method is based on the existing stabilized SQP method and can find a point satisfying the Karush-Kuhn-Tucker (KKT) or asymptotic KKT conditions. One of the remarkable points is that we prove its global convergence to such a point under some assumptions without any constraint qualifications. In addition, we guarantee that an arbitrary accumulation point generated by the proposed method satisfies the KKT conditions under several additional assumptions. Finally, we report some numerical experiments to examine the effectiveness of the proposed method.","PeriodicalId":54707,"journal":{"name":"Numerical Functional Analysis and Optimization","volume":"44 1","pages":"867 - 905"},"PeriodicalIF":1.4000,"publicationDate":"2023-04-27","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.2023.2178009","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0
Abstract
Abstract In this paper, we propose a stabilized sequential quadratic programming (SQP) method for optimization problems in function spaces. A form of the problem considered in this paper can widely formulate many types of applications, such as obstacle problems, optimal control problems, and so on. Moreover, the proposed method is based on the existing stabilized SQP method and can find a point satisfying the Karush-Kuhn-Tucker (KKT) or asymptotic KKT conditions. One of the remarkable points is that we prove its global convergence to such a point under some assumptions without any constraint qualifications. In addition, we guarantee that an arbitrary accumulation point generated by the proposed method satisfies the KKT conditions under several additional assumptions. Finally, we report some numerical experiments to examine the effectiveness of the proposed method.
期刊介绍:
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.