Publication Cover
Optimization
A Journal of Mathematical Programming and Operations Research
Volume 68, 2019 - Issue 6
180
Views
1
CrossRef citations to date
0
Altmetric
Articles

Strong calmness of perturbed KKT system for a class of conic programming with degenerate solutions

&
Pages 1131-1156 | Received 21 Mar 2018, Accepted 26 Jan 2019, Published online: 14 Feb 2019
 

ABSTRACT

This paper is concerned with the strong calmness of the KKT solution mapping for a class of canonically perturbed conic programming, which plays a central role in achieving fast convergence under situations when the Lagrange multiplier associated to a solution of these conic optimization problems is not unique. We show that the strong calmness of the KKT solution mapping is equivalent to a local error bound for the solutions to the perturbed KKT system, and is also equivalent to the pseudo-isolated calmness of the stationary point mapping along with the calmness of the multiplier set mapping at the corresponding reference point. Sufficient conditions are also provided for the strong calmness by establishing the pseudo-isolated calmness of the stationary point mapping in terms of the noncriticality of the associated multiplier, and the calmness of the multiplier set mapping in terms of a relative interior condition for the multiplier set. These results cover and extend the existing ones in Hager and Gowda [Stability in the presence of degeneracy and error estimation. Math Program. 1999;85:181–192]; Izmailov and Solodov [Stabilized SQP revisited. Math Program. 2012;133:93–120] for nonlinear programming and in Cui et al. [On the asymptotic superlinear convergence of the augmented Lagrangian method for semidefinite programming with multiple solutions. 2016, arXiv: 1610.00875v1]; Zhang and Zhang [Critical multipliers in semidefinite programming. 2018, arXiv: 1801.02218v1] for semidefinite programming.

2010 AMS CLASSIFICATIONS:

Disclosure statement

No potential conflict of interest was reported by the authors.

Additional information

Funding

This work was supported by the National Natural Science Foundation of China under project [grant No. 11571120] and the Open Project Program of the State Key Lab of CAD & CG [grant No. A1808] Zhejiang University.

Log in via your institution

Log in to Taylor & Francis Online

PDF download + Online access

  • 48 hours access to article PDF & online version
  • Article PDF can be downloaded
  • Article PDF can be printed
USD 61.00 Add to cart

Issue Purchase

  • 30 days online access to complete issue
  • Article PDFs can be downloaded
  • Article PDFs can be printed
USD 630.00 Add to cart

* Local tax will be added as applicable

Related Research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.