Abstract
This note establishes a new sufficient condition for the existence and uniqueness of the Alizadeh-Haeberly-Overton direction for semidefinite programming.
This is a preview of subscription content, log in via an institution to check access.
References
F. Alizadeh, J.-P.A. Haeberly and M.L. Overton, Primal-dual interior-point methods for semidefinite programming, Technical Report 659, Computer Science Department, Courant Institute of Mathematical Sciences, New York University (1994).
R.A. Horn and C.R. Johnson,Matrix Analysis (Cambridge University Press, New York, 1985).
R.A. Horn and C.R. Johnson,Topics in Matrix Analysis (Cambridge University Press, New York, 1991).
M. Shida, S. Shindoh and M. Kojima, Existence of search directions in interior-point algorithms for the SDP and monotone SDLCP programs, Research Report #B-310, Dept. of Mathematical and Computing Sciences, Tokyo Institute of Technology, 2-12-1 Oh-Okayama, Meguro-ku, Tokyo 152 (1996).
M.J. Todd, K.C. Toh and R.H. Tütüncü, On the Nesterov-Todd direction in semidefinite programming, Technical Report, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY 14853, USA (March 1996).
Author information
Authors and Affiliations
Additional information
The work of these authors was based on research supported by the National Science Foundation under grants INT-9600343 and CCR-970048 and the Office of Naval Research under grant N00014-94-1-0340.
Rights and permissions
About this article
Cite this article
Monteiro, R.D.C., Zanjácomo, P.R. A note on the existence of the Alizadeh-Haeberly-Overton direction for semidefinite programming. Mathematical Programming 78, 393–396 (1997). https://doi.org/10.1007/BF02614363
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02614363