Solving Reduced KKT Systems in Barrier Methods for Linear and Quadratic Programming
暂无分享,去创建一个
[1] Anthony V. Fiacco,et al. Nonlinear programming;: Sequential unconstrained minimization techniques , 1968 .
[2] J. Bunch,et al. Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations , 1971 .
[3] J. Bunch,et al. Some stable methods for calculating inertia and solving symmetric linear systems , 1977 .
[4] R. Rockafellar. Monotone Operators and the Proximal Point Algorithm , 1976 .
[5] O. Mangasarian,et al. NONLINEAR PERTURBATION OF LINEAR PROGRAMS , 1979 .
[6] Iain S. Duff,et al. MA27 -- A set of Fortran subroutines for solving sparse symmetric sets of linear equations , 1982 .
[7] Robert Fourer,et al. Solving staircase linear programs by the simplex method, 1: Inversion , 1982, Math. Program..
[8] John K. Reid,et al. The Multifrontal Solution of Indefinite Sparse Symmetric Linear , 1983, TOMS.
[9] O. Mangasarian. Normal solutions of linear programs , 1984 .
[10] Jack J. Dongarra,et al. Distribution of mathematical software via electronic mail , 1985, SGNM.
[11] Michael A. Saunders,et al. On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method , 1986, Math. Program..
[12] M. Kojima,et al. A primal-dual interior point algorithm for linear programming , 1988 .
[13] R. C. Monteiro,et al. Interior path following primal-dual algorithms , 1988 .
[14] Aeneas Marxen. Primal Barrier Methods for Linear Programming , 1989 .
[15] Michael A. Saunders,et al. A practical anti-cycling procedure for linearly constrained optimization , 1989, Math. Program..
[16] Jeffrey C. Lagarias,et al. Power series variants of Karmarkar-type algorithms , 1989, AT&T Technical Journal.
[17] Clyde L. Monma,et al. An Implementation of a Primal-Dual Interior Point Method for Linear Programming , 1989, INFORMS J. Comput..
[18] N. Megiddo. Pathways to the optimal set in linear programming , 1989 .
[19] Renato D. C. Monteiro,et al. Interior path following primal-dual algorithms. part II: Convex quadratic programming , 1989, Math. Program..
[20] Mauricio G. C. Resende,et al. A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension , 1990, Math. Oper. Res..
[21] K. Turner. Computing projections for the Karmarkar algorithm , 1991 .
[22] Sanjay Mehrotra. Handling free variables in interior methods , 1991 .
[23] I. Lustig,et al. Computational experience with a primal-dual interior point method for linear programming , 1991 .
[24] I. Duff,et al. The factorization of sparse symmetric indefinite matrices , 1991 .
[25] D. Ponceleón. Barrier methods for large-scale quadratic programming , 1991 .
[26] R. Vanderbei. Splitting dense columns in sparse linear systems , 1991 .
[27] Sanjay Mehrotra. On finding a vertex solution using interior point methods , 1991 .
[28] R. Setiono. Interior proximal point algorithm for linear programs , 1992 .
[29] R. Setiono. Interior dual proximal point algorithm using preconditioned conjugate gradient , 1992 .
[30] Sanjay Mehrotra,et al. On the Implementation of a Primal-Dual Interior Point Method , 1992, SIAM J. Optim..
[31] Michael A. Saunders,et al. Preconditioners for Indefinite Systems Arising in Optimization , 1992, SIAM J. Matrix Anal. Appl..
[32] Roy E. Marsten,et al. On Implementing Mehrotra's Predictor-Corrector Interior-Point Method for Linear Programming , 1992, SIAM J. Optim..
[33] Robert J. Vanderbei,et al. Symmetric indefinite systems for interior point methods , 1993, Math. Program..
[34] R. Setiono. Interior dual least 2-norm algorithm for linear programs , 1993 .