Superlinearly Convergent Norm-Relaxed SQP Method Based on Active Set Identification and New Line Search for Constrained Minimax Problems
Jin-bao Jian (),
Qing-juan Hu () and
Chun-ming Tang ()
Additional contact information
Jin-bao Jian: Yulin Normal University
Qing-juan Hu: Luoshan Secondary Vocational School
Chun-ming Tang: Guangxi University
Journal of Optimization Theory and Applications, 2014, vol. 163, issue 3, No 10, 859-883
Abstract:
Abstract In this paper, the minimax problems with inequality constraints are discussed, and an alternative fast convergent method for the discussed problems is proposed. Compared with the previous work, the proposed method has the following main characteristics. First, the active set identification which can reduce the scale and the computational cost is adopted to construct the direction finding subproblems. Second, the master direction and high-order correction direction are computed by solving a new type of norm-relaxed quadratic programming subproblem and a system of linear equations, respectively. Third, the step size is yielded by a new line search which combines the method of strongly sub-feasible direction with the penalty method. Fourth, under mild assumptions without any strict complementarity, both the global convergence and rate of superlinear convergence can be obtained. Finally, some numerical results are reported.
Keywords: Constrained minimax problems; SQP method; Active set identification; Line search; Superlinear convergence (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)
Downloads: (external link)
http://link.springer.com/10.1007/s10957-013-0503-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:163:y:2014:i:3:d:10.1007_s10957-013-0503-5
Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2
DOI: 10.1007/s10957-013-0503-5
Access Statistics for this article
Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull
More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().