A globally convergent SQP-type method with least constraint violation for nonlinear semidefinite programming

IF 1.6 3区数学 Q2 MATHEMATICS, APPLIED

Optimization Pub Date : 2024-04-29 DOI:10.1080/02331934.2024.2345397

Wenhao Fu, Zhongwen Chen

引用次数: 0

Abstract

We present a globally convergent SQP-type method with the least constraint violation for nonlinear semidefinite programming. The proposed algorithm employs a two-phase strategy coupled with a line ...

查看原文本刊更多论文

非线性半定式程序设计的全局收敛 SQP 型方法，约束违反最少

我们提出了一种全局收敛的 SQP 型方法，该方法对非线性半定式编程的约束违反最少。所提出的算法采用了一种两阶段策略，并与线性方程组相结合。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Optimization 数学-应用数学

CiteScore

4.50

自引率

9.10%

发文量

146

审稿时长

4.5 months

期刊介绍： Optimization publishes refereed, theoretical and applied papers on the latest developments in fields such as linear, nonlinear, stochastic, parametric, discrete and dynamic programming, control theory and game theory. A special section is devoted to review papers on theory and methods in interesting areas of mathematical programming and optimization techniques. The journal also publishes conference proceedings, book reviews and announcements. All published research articles in this journal have undergone rigorous peer review, based on initial editor screening and anonymous refereeing by independent expert referees.