Interior point methods 25 years later

European Journal of Operational Research

Volumn 218, Issue 3, 2012, Pages 587-601

  Gondzio, Jacek ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Implementation; Interior point methods; Linear programming; Matrix free methods; Quadratic programming; Worst case complexity analysis

Indexed keywords

MATRIX ALGEBRA; POLYNOMIALS; PROBLEM SOLVING; QUADRATIC PROGRAMMING;

IMPLEMENTATION; INTERIOR-POINT METHOD; LARGE-SCALE OPTIMIZATION; MATRIX-FREE METHODS; NUMBER OF ITERATIONS; OPTIMIZATION PROBLEMS; WORST-CASE COMPLEXITY; WORST-CASE COMPLEXITY ANALYSIS;

LINEAR PROGRAMMING;

EID: 84855790699     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2011.09.017     Document Type: Article

References (106)

1. G. Al-Jeiroudi, and J. Gondzio Convergence analysis of inexact infeasible interior point method for linear optimization Journal of Optimization Theory and Applications 141 2009 231 247
2. G. Al-Jeiroudi, J. Gondzio, and J. Hall Preconditioning indefinite systems in interior point methods for large scale linear optimization Optimization Methods and Software 23 2008 345 363
3. A. Altman, and J. Gondzio Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization Optimization Methods and Software 11-12 1999 275 302
4. E.D. Andersen, J. Gondzio, C. Mészáros, and X. Xu Implementation of interior point methods for large scale linear programming T. Terlaky, Interior Point Methods in Mathematical Programming 1996 Kluwer Academic Publishers 189 252
5. M. Arioli, I.S. Duff, and P.P.M. de Rijk On the augmented system approach to sparse least-squares problems Numerische Mathematik 55 1989 667 684
6. J.S. Bell On the Einstein-Podolsky-Rosen paradox Physics 1 1964 195 200
7. S. Bellavia An inexact interior point method Journal of Optimization Theory and Applications 96 1998 109 121
8. M. Benzi, G. Golub, and J. Liesen Numerical solution of saddle point problems Acta Numerica 14 2005 1 137 (Pubitemid 40771317)
9. L. Bergamaschi, J. Gondzio, M. Venturin, and G. Zilli Inexact constraint preconditioners for linear system arising in interior point methods Computational Optimization and Applications 36 2007 137 147 (Pubitemid 46723396)
10. L. Bergamaschi, J. Gondzio, and G. Zilli Preconditioning indefinite systems in interior point methods for optimization Computational Optimization and Applications 28 2004 149 171
11. D.P. Bertsekas Nonlinear Programming 1995 Athena Scientific Massachusetts
12. J.R. Birge, and L. Qi Computing block-angular Karmarkar projections with applications to stochastic programming Management Science 34 1988 1472 1479
13. R.E. Bixby Progress in linear programming ORSA Journal on Computing 6 1994 15 22
14. S. Bocanegra, F. Campos, and A. Oliveira Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods Computational Optimization and Applications 36 2007 149 164 (Pubitemid 46723397)
15. J.R. Bunch, and B.N. Parlett Direct methods for solving symmetric indefinite systems of linear equations SIAM Journal on Numerical Analysis 8 1971 639 655
16. R.E. Burkard, S.E. Karisch, and F. Rendl QAPLIB - a quadratic assignment problem library Journal of Global Optimization 10 1997 391 403 (Pubitemid 127502198)
17. S. Cafieri, M. D'Apuzzo, V. De Simone, D. di Serafino, and G. Toraldo Convergence analysis of an inexact potential reduction method for convex quadratic programming Journal of Optimization Theory and Applications 135 2007 355 366
18. J. Castro A specialized interior-point algorithm for multicommodity network flows SIAM Journal on Optimization 10 2000 852 877
19. J. Castro, and J. Cuesta Quadratic regularizations in an interior point method for primal block-angular problems Mathematical Programming 2010 Published online 19 February 2010, DOI: 10.1007/s10107-010-0341-2
20. J. Chai, and K. Toh Preconditioning and iterative solution of symmetric indefinite linear systems arising from interior point methods for linear programming Computational Optimization and Applications 36 2007 221 247 (Pubitemid 46723400)
21. I.C. Choi, and D. Goldfarb Exploiting special structure in a primal-dual path following algorithm Mathematical Programming 58 1993 33 52 (Pubitemid 23686632)
22. M. Colombo, and J. Gondzio Further development of multiple centrality correctors for interior point methods Computational Optimization and Applications 41 2008 277 305
23. G.B. Dantzig Linear Programming and Extensions 1963 Princeton University Press Princeton
24. M. D'Apuzzo, V. De Simone, and D. di Serafino On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods Computational Optimization and Applications 45 2010 283 310
25. M. D'Apuzzo, V. De Simone, and D. di Serafino Starting-point strategies for an infeasible potential reduction method Optimization Letters 4 2010 131 146
26. R.S. Dembo, S.C. Eisenstat, and T. Steihaug Inexact Newton methods SIAM Journal on Numerical Analysis 19 1982 400 408
27. I.I. Dikin On the speed of an iterative process Upravlaemye Sistemy 12 1974 54 60
28. H. Dollar, N. Gould, W. Schilders, and A. Wathen Using constraint preconditioners with regularized saddle-point problems Computational Optimization and Applications 36 2007 249 270 (Pubitemid 46723401)
29. I.S. Duff, A.M. Erisman, and J.K. Reid Direct Methods for Sparse Matrices 1987 Oxford University Press New York
30. C. Durazzi, and V. Ruggiero Indefinitely preconditioned conjugate gradient method for large sparse equality and inequality constrained quadratic problems Numerical Linear Algebra with Applications 10 2003 673 688 (Pubitemid 37495955)
31. A. Einstein, B. Podolsky, and N. Rosen Can quantum-mechanical description of physical reality be considered complete? Physical Review 47 1935 777 780
32. A.V. Fiacco, and G.P. McCormick Nonlinear Programming: Sequential Unconstrained Minimization Techniques 1968 John Wiley and Sons New York
33. J.J.H. Forrest, and D. Goldfarb Steepest-edge simplex algorithms for linear programming Mathematical Programming 57 1992 341 374 (Pubitemid 23635096)
34. A. Forsgren, P.E. Gill, and M.H. Wright Interior methods for nonlinear optimization SIAM Review 44 2002 525 597
35. A. Frangioni, and C. Gentile Prim-based support-graph preconditioners for min-cost flow problems Computational Optimization and Applications 36 2007 271 287 (Pubitemid 46723402)
36. M. Friedlander, D. Orban, A primal-dual regularized interior-point method for convex quadratic programming, Tech. Rep. G-2010-47, GERAD, University of Montreal, Canada, 2010.
37. K.R. Frisch, The logarithmic potential method of convex programming, tech. rep., University Institute of Economics, Oslo, Norway, 1955.
38. E.M. Gertz, and S.J. Wright Object-oriented software for quadratic programming ACM Transactions on Mathematical Software 29 2003 58 81 (Pubitemid 40000552)
39. P.E. Gill, W. Murray, D.B. Ponceleón, and M.A. Saunders Preconditioners for indefinite systems arising in optimization SIAM Journal on Matrix Analysis and Applications 13 1992 292 311
40. P.E. Gill, W. Murray, M.A. Saunders, J.A. Tomlin, and M.H. Wright On the projected Newton barrier methods for linear programming and an equivalence to Karmarkar's projective method Mathematical Programming 36 1986 183 209 (Pubitemid 17513077)
41. D. Goldfarb, and M.J. Todd Linear programming G.L. Nemhauser, A.H.G. Rinnooy Kan, M.J. Todd, Optimization 1989 North Holland Amsterdam 73 170
42. J. Gondzio Multiple centrality corrections in a primal-dual method for linear programming Computational Optimization and Applications 6 1996 137 156 (Pubitemid 126706904)
43. J. Gondzio, Matrix-free interior point method, Computational Optimization and Applications, 2010. Published online October 14, 2010: doi:10.1007/s10589- 010-9361-3.
44. 9 arising in optimization with interior point methods R. Wyrzykowski, J. Dongarra, N. Meyer, J. Wasniewski, Parallel Processing and Applied Mathematics Lecture Notes in Computer Science vol. 3911 2006 Springer-Verlag Berlin 513 525 (Pubitemid 44020059)
45. J. Gondzio, and A. Grothey Solving nonlinear portfolio optimization problems with the primal-dual interior point method European Journal of Operational Research 181 2007 1019 1029 (Pubitemid 46498509)
46. J. Gondzio, and R. Sarkissian Parallel interior point solver for structured linear programs Mathematical Programming 96 2003 561 584
47. C.C. Gonzaga Path-following methods for linear programming SIAM Review 34 1992 167 224
48. S. Grblacher, T. Paterek, R. Kaltenbaek, C. Brukner, M. ukowski, M. Aspelmeyer, and A. Zeilinger An experimental test of non-local realism Nature 446 2007 871 875 (Pubitemid 46633162)
49. M.D. Grigoriadis, and L.G. Khachiyan An interior point method for bordered block-diagonal linear programs SIAM Journal on Optimization 6 1996 913 932
50. J. Gruca, Nonclassical properties of multiqubit quantum states applicable in quantum information science, Master's thesis, University of Gdansk, 2008.
51. J. Gruca, W. Laskowski, M. ukowski, N. Kiesel, W. Wieczorek, C. Schmid, and H. Weinfurter Nonclassicality thresholds for multiqubit states: Numerical analysis Physical Review A 82 2010 012118
52. J.-P. Haeberly, M. Nayakkankuppam, and M. Overton Extending Mehrotra and Gondzio higher order methods to mixed semidefinite-quadratic-linear programming Optimization Methods and Software 11 1999 67 90
53. J.A.J. Hall Towards a practical parallelisation of the simplex method Computational Management Science 7 2010 139 170
54. J.A.J. Hall, and K.I.M. McKinnon Hyper-sparsity in the revised simplex method and how to exploit it Computational Optimization and Applications 32 2005 259 283 (Pubitemid 41406909)
55. M.R. Hestenes, and E. Stiefel Methods of conjugate gradients for solving linear systems Journal of Research of the National Bureau Standards 49 1952 409 436
56. J.K. Hurd, and F.M. Murphy Exploiting special structure in a primal-dual interior point methods ORSA Journal on Computing 4 1992 39 44
57. B. Jansen, C. Roos, T. Terlaky, and J.-P. Vial Primal-dual target following algorithms for linear programming Annals of Operations Research 62 1996 197 231 K. Anstreicher, R. Freund (Eds.)
58. E.R. Jessup, D. Yang, and S.A. Zenios Parallel factorization of structured matrices arising in stochastic programming SIAM Journal on Optimization 4 1994 833 846
59. J.J. Júdice, J. Patricio, L.F. Portugal, M.G.C. Resende, and G. Veiga A study of preconditioners for network interior point methods Computational Optimization and Applications 24 2003 5 35
60. L.V. Kantorovich The Best Use of Economic Resources 1965 Harvard University Press Harvard
61. N.K. Karmarkar A new polynomial-time algorithm for linear programming Combinatorica 4 1984 373 395
62. D. Kaszlikowski, P. Gnacinski, M. ukowski, W. Miklaszewski, and A. Zeilinger Violations of local realism by two entangled qunits are stronger than for two qubits Physics Review Letters 85 2000 4418
63. D. Kaszlikowski, M. ukowski, and P. Gnacinski A note on bound entanglement and local realism Physical Review A 65 2002 032107
64. C. Keller, N.I.M. Gould, and A.J. Wathen Constraint preconditioning for indefinite linear systems SIAM Journal on Matrix Analysis and Applications 21 2000 1300 1317 (Pubitemid 33217070)
65. C.T. Kelley Iterative Methods for Linear and Nonlinear Equations Frontiers in Applied Mathematics vol. 16 1995 SIAM Philadelphia
66. L.G. Khachiyan A polynomial algorithm in linear programming Soviet Mathematics Doklady 20 1979 191 194
67. V. Klee, and G. Minty How good is the simplex algorithm O. Shisha, Inequalities-III 1972 Academic Press 159 175
68. M. Kojima, N. Megiddo, and S. Mizuno A primal-dual infeasible-interior- point algorithm for linear programming Mathematical Programming 61 1993 263 280
69. M. Kojima, S. Mizuno, and A. Yoshise A primal-dual interior point algorithm for linear proramming N. Megiddo, Progress in Mathematical Programming: Interior-Point Algorithms and Related Methods 1989 Springer-Verlag Berlin, Germany 29 47
70. M. Lobo, L. Vandenberghe, S. Boyd, and H. Lebret Applications of second-order cone programming Linear Algebra and its Applications 284 1998 193 228
71. Z. Lu, R.D.S. Monteiro, and J.W. O'Neal An iterative solver-based infeasible primal-dual path-following algorithm for convex quadratic programming SIAM Journal on Optimization 17 2006 287 310
72. L. Lukšan, and J. Vlček Indefinitely preconditioned inexact Newton method for large sparse equality constrained nonlinear programming problems Numerical Linear Algebra with Applications 5 1998 219 247 (Pubitemid 128475839)
73. I.J. Lustig, R.E. Marsten, and D.F. Shanno On implementing Mehrotra's predictor-corrector interior point method for linear programming SIAM Journal on Optimization 2 1992 435 449
74. I.J. Lustig, R.E. Marsten, and D.F. Shanno Interior point methods for linear programming: Computational state of the art ORSA Journal on Computing 6 1994 1 14
75. I. Maros Computational Techniques of the Simplex Method first ed. 2003 Kluwer Academic Publishers Boston
76. R.E. Marsten, R. Subramanian, M.J. Saltzman, I.J. Lustig, and D.F. Shanno Interior point methods for linear programming: Just call Newton, Lagrange, and Fiacco and McCormick! Interfaces 20 1990 105 116
77. N. Megiddo Pathways to the optimal set in linear programming N. Megiddo, Progress in Mathematical Programming: Interior-Point Algorithms and Related Methods 1989 Springer-Verlag Berlin, Germany
78. S. Mehrotra On the implementation of a primal-dual interior point method SIAM Journal on Optimization 2 1992 575 601
79. C. Mészáros On the performance of the Cholesky factorization in interior point methods on Pentium 4 processors Central European Journal of Operations Research 13 2005 289 298
80. C. Mészáros Sparsity in convex quadratic programming with interior point methods Optimization Methods and Software 21 2006 733 745 (Pubitemid 43982763)
81. C. Mészáros Detecting "dense" columns in interior point methods for linear programming Computational Optimization and Applications 36 2007 309 320 (Pubitemid 46723403)
82. S. Mizuno, and F. Jarre Global and polynomial-time convergence of an infeasible-interior point algorithm using inexact computation Mathematical Programming 84 1999 105 122
83. Y. Nesterov Introductory Lectures on Convex Optimization: A Basic Course 2004 Kluwer Boston
84. Y. Nesterov Smooth minimization of non-smooth functions Mathematical Programming 103 2005 127 152 (Pubitemid 40537674)
85. Y. Nesterov, and A. Nemirovskii Interior Point Polynomial Algorithms in Convex Programming: Theory and Applications 1994 SIAM Philadelphia
86. C.E. Nugent, T.E. Vollman, and J. Ruml An experimental comparison of techniques for assignment of facilities to locations Operations Research 16 1968 150 173
87. A.R.L. Oliveira, A New Class of Preconditioners for Large-Scale Linear Systems from Interior Point Methods for Linear Programming, Ph.D. Thesis, Department of Computational and Applied Mathematics, Rice University, Houston, TX 77005, 1997.
88. A.R.L. Oliveira, and D.C. Sorensen A new class of preconditioners for large-scale linear systems from interior point methods for linear programming Linear Algebra and its Applications 394 2005 1 24
89. P.M. Pardalos, F. Rendl, H. Wolkowicz, The quadratic assignment problem: A survey of recent developments, in: P.M. Pardalos, H. Wolkowicz (Eds.), Quadratic Assignment and Related Problems, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 1994, pp. 1-42.
90. J. Renegar A polynomial-time algorithm, based on Newton's method, for linear programming Mathematical Programming 40 1988 59 93 (Pubitemid 18561562)
91. M.G.C. Resende, and G. Veiga An implementation of the dual affine scaling algorithm for minimum cost flow on bipartite uncapacitated networks SIAM Journal on Optimization 3 1993 516 537
92. M. Rozlozník, and V. Simoncini Krylov subspace methods for saddle point problems with indefinite preconditioning SIAM Journal of Matrix Analysis and Applications 24 2002 368 391 (Pubitemid 36446414)
93. M. Saunders Cholesky-based methods for sparse least squares: The benefits of regularization L. Adams, L. Nazareth, Linear and Nonlinear Conjugate Gradient-Related Methods 1996 SIAM Philadelphia, USA 92 100
94. M. Saunders, J.A. Tomlin, Solving regularized linear programs using barrier methods and KKT systems, Tech. Rep. SOL 96-4, Systems Optimization Laboratory, Department of Operations Research, Stanford University, Stanford, CA 94305, USA, December 1996.
95. O. Schenk, A. Wächter, and M. Weiser Inertia revealing preconditioning for large-scale nonconvex constrained optimization SIAM Journal on Scientific Computing 31 2008 939 960
96. G. Schultz, and R.R. Meyer An interior point method for block angular optimization SIAM Journal on Optimization 1 1991 583 602
97. G.W. Stewart On scaled projections and pseudoinverses Linear Algebra and its Applications 112 1989 189 193
98. U.H. Suhl, and L.M. Suhl Computing sparse LU factorizations for large-scale linear programming bases ORSA Journal on Computing 2 1990 325 335
99. T. Terlaky Criss-cross pivoting rules C. Floudas, P. Pardalos, Encyclopedia of Optimization 2009 Kluwer Academic Publishers 584 590
100. M.J. Todd Exploiting special structure in Karmarkar's linear programming algorithm Mathematical Programming 41 1988 81 103
101. L. Vandenberghe, and S. Boyd Semidefinite programming SIAM Review 38 1996 49 95 (Pubitemid 126610912)
102. R.J. Vanderbei Symmetric quasidefinite matrices SIAM Journal on Optimization 5 1995 100 113
103. R.J. Vanderbei LOQO: An interior point code for quadratic programming Optimization Methods and Software 11-12 1999 451 484
104. R.J. Vanderbei, and D.F. Shanno An interior-point algorithm for nonconvex nonlinear programming Computational Optimization and Applications 13 1999 231 252 (Pubitemid 129574944)
105. S.J. Wright Primal-Dual Interior-Point Methods 1997 SIAM Philadelphia
106. M. ukowski, and D. Kaszlikowski Critical visibility for N-particle Greenberger-Horne-Zeilinger correlations to violate local realism Physical Review A 56 1997 R1685