Extending Mehrotra and Gondzio higher order methods to mixed semidefinite-quadratic-linear programming

Optimization Methods and Software

Volumn 11, Issue 1, 1999, Pages 67-90

  Haeberly, Jean Pierre ^a   Nayakkankuppam, Madhu V ^b   Overton, Michael L ^b  

^a FORDHAM UNIVERSITY   (United States)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; C (PROGRAMMING LANGUAGE); CODES (SYMBOLS); QUADRATIC PROGRAMMING;

MIXED SEMIDEFINITE-QUADRATIC-LINEAR PROGRAMMING (SQLP);

LINEAR PROGRAMMING;

EID: 0033297001     PISSN: 10556788     EISSN: None     Source Type: Journal    
DOI: 10.1080/10556789908805748     Document Type: Article

References (17)

1. Adler, I. and Alizadeh, F. (1995). Primal-dual interior point algorithms for convex quadratically constrained and semidefinite optimization problems, Tech. Report RRR 46-95, RUTCOR. Rutgers University, Piscataway, NJ, December.
2. Alizadeh, F. (1995). Interior-point methods in semidefinite programming with applications to combinatorial optimization, SIAM Journal on Optimization, 5, 13-51.
3. Alizadeh, F., Haeberly, J.-P., Nayakkankuppam, M. V., Overton, M. L. and Schmieta, S. (1997). SDPpack User Guide (Version 0.9 Beta), Tech. Report 737, Department of Computer Science, New York University, New York, NY, June.
4. Alizadeh, F., Haeberly, J.-P. and Overton, M. L. (1998). Primal-dual interior-point methods for semi-definite programming: convergence rates, stability, and numerical results, SIAM Journal on Optimization, 8, 746-768.
5. Alizadeh, F. and Schmieta, S. (1997). Optimization with semidefinite, quadratic and linear constraints, Tech. Report RRR23-97, RUTCOR. Rutgers University, Piscataway, NJ.
6. Anderson, E., Bai, Z., Bischof, C., Demmel, J., Dongarra, J., Du Croz, J., Greenbaum, A., Hammarling, S., McKenney, A., Oustrouchov, S. and Sorensen, D. (1995). LAPACK User's Guide, 2nd ed. SIAM, Philadelphia, PA.
7. Carpenter, T. J., Lustig, I. J., Mulvey, J. M. and Shanno, D. F. (1993). Higher-order predictor-corrector interior-point methods with application to quadratic objectives, SIAM Journal on Optimization, 3, 696-725.
8. Czyzyk, J., Mehrotra, S., Wagner, M. and Wright, S. J. (1997). PCx User Guide (Version 1.1), Tech. Report OTC 96/01, Optimization Technology Center, Chicago, Il.
9. Duff, I. S., Grimes, R. G. and Lewis, J. G. (1992). User's guide for the Harwell-Boeing sparse matrix collection (release 1), Tech. Report RAL-92-086, Rutherford Appleton Laboratory.
10. Gondzio, J. (1996). Multiple centrality corrections in a primal-dual method for linear programming, Computational Optimization and Applications, 6, 137-156.
11. Gondzio, J. and Makowski, M. (1995). HOPDM modular solver for LP problems, User's guide to version 2.12, Tech. Report WP-95-50, International Institute for Applied Systems Analysis, Laxenburg, Austria, June.
12. Horn, R. A. and Johnson, C. R. (1994). Topics in matrix analysis. Cambridge University Press, Cambridge, UK.
13. Mehrotra, S. (1991). Higher order methods and their performance, Tech. Report 90-16R1, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, Ill.
14. _. (1992). On the implementation of a primal-dual interior point method, SIAM Journal on Optimization, 2, 575-601.
15. Nesterov, Yu. E. and Nemirovskii, A. (1994). Interior-point polynomial algorithms in convex programming. SIAM, Philadelphia, PA.
16. Vandenberghe, L., Boyd, S. and El Gamal, A. (1997). Optimal wire and transistor sizing for circuits with non-tree topology, Proceedings of the IEEE International Conference on Computer-Aided Design (San Jose, CA).
17. Wright, S. J. (1997). Primal-dual interior-point methods, SIAM, Philadelphia, PA.