Abstract
Using a weaker version of the Newton-Kantorovich theorem [6] given by us in [3], we show how to refine the results given in [8] dealing with the analyzing of the effect of small perturbations in problem data on the solution. The new results are obtained under weaker hypotheses and the same computational cost as in [8].
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
F. Alizadeh, J.-P.A. Haeberly and M.L. Overton,Complementarity and nondegeneracy in semidefinite programming, Math. Progr. 77 (1997), 29–43.
F. Alizadeh, J.-P.A. Haeberly and M.L. Overton,Primal-dual interior point algorithms for semidefinite programming: stability, convergence and numerical results, SIAM J. Optim.8 (1998), 743–768.
I.K. Argyros,On the Newton-Kantorovich hypothesis for solving equations, J. Comp. Appl. Math.169, (2004), 315–332.
I.K. Argyros,Newton Methods, Nova Science Publ. Corp., New York, 2005.
J.P.A. Haeberly,Remarks on nondegeneracy in mixed semidefinite-quadratic program- ming, Unpublished memorandum, available at URL: http: //corky.fordham.edu /hae- berly/papers/sqldegen.ps.gz
L.V. Kantorovich and G.P. Akilov,Functional Analysis in Normed Spaces, Pergamon Press, Oxford, 1982.
E.S. Levitin,Perturbation Theory in Mathematical Programming and Its Applications, Wiley Interscience Series in Discrete Mathematics and Optimization, Wiley and Sons, New York, 1982.
M.V. Nayakkankuppam and M.L. Overton,Conditioning of semidefinite programs, Math. Progr.85 (1999), 525–540.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Argyros, I.K. A refined theorem concerning the conditioning of semidefinite programs. J. Appl. Math. Comput. 24, 305–312 (2007). https://doi.org/10.1007/BF02832319
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02832319