A SQP Algorithm for Solving Constrained Min-Max ProblemsChinese Full Text
CHENYuan;HU Bo-xia;LI Long;SHI Xian-ming;Dept.of Mathematics and Computational Science,Hengyang Normal University;
Abstract: A SQP algorithm to tackle constrained min-max problems was introduced.Adding just one extra variable,a constrained min-max problem was transformed into sequence quadratic programming problem.It is proved that,under certain reasonable assumptions,the minimize of this sequence quadratic programming problem is equivalent to the minimize of the original constrained one.The numerical results demonstrate that the SQP algorithm is an effective and promising approach for solving constrained finite min-max problems.
- DOI：
10.13914/j.cnki.cn43-1453/z.2014.03.003
- Series：
- Subject：
- Classification Code：
O224
- Mobile Reading
Read on your phone instantly
Step 1Scan QR Codes
"Mobile CNKI-CNKI Express" App
Step 2Open“CNKI Express”
and click the scan icon in the upper left corner of the homepage.
Step 3
Scan QR Codes
Read this article on your phone.
- HTML
- CAJ Download
- PDF Download
Download the mobile appuse the app to scan this coderead the article.
Tips: Please download CAJViewer to view CAJ format full text.
Download: 141 Page: 8-10 Pagecount: 3 Size: 116K
Citation Network
Related Literature
- Similar Article
- Reader Recommendation
- Associated Author