R. H. Bartels, A stabilization of the simplex method, Numerische Mathematik, 16 (1971), pp. 414--434. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
MINOS: A Solver for Large-Scale - Nonlinear Optimization Problems (Correct)
....(typically 10 6 ) In rare cases, even nonbasic variables might lie outside their bounds by as much as #. GAMS MINOS maintains a sparse LU factorization of the basis matrix B, using a Markowitz ordering scheme and Bartels Golub updates, as implemented in the Fortran package LUSOL[7] see [1, 2, 11, 12]) The basis factorization is central to the e#cient handling of sparse linear and nonlinear constraints. 3.2 Problems with a Nonlinear Objective When nonlinearities are confined to the term F (x) in the objective function, the problem is a linearly constrained nonlinear program. GAMS MINOS ....
R. H. Bartels, A stabilization of the simplex method, Numerische Mathematik, 16 (1971), pp. 414--434.
Gams/minos: A Solver For Large-Scale Nonlinear.. - Murtagh, Saunders, .. (2002) (Correct)
....(typically 10 6 ) In rare cases, even nonbasic variables might lie outside their bounds by as much as #. GAMS MINOS maintains a sparse LU factorization of the basis matrix B, using a Markowitz ordering scheme and Bartels Golub updates, as implemented in the Fortran package LUSOL[7] see [1, 2, 11, 12]) The basis factorization is central to the e#cient handling of sparse linear and nonlinear constraints. 3.2 Problems with a Nonlinear Objective When nonlinearities are confined to the term F (x) in the objective function, the problem is a linearly constrained nonlinear program. GAMS MINOS ....
R. H. Bartels, A stabilization of the simplex method, Numerische Mathematik, 16 (1971), pp. 414--434.
Dense Factors of Sparse Matrices - Fletcher (1997) (Correct)
....23 s 24 s 31 s 32 s 33 s 34 s 41 s 42 s 43 s 44 3 7 7 7 5 A 0 = 2 6 6 6 4 1 0 1 1 s 1 3 7 7 7 5 2 6 6 6 4 u 11 u 13 u 14 u 23 u 24 u 33 u 34 u 44 3 7 7 7 5 : 18 R. Fletcher is used, where s = Gammau 23 =u 33 , and the situation is somewhat reminiscent of the BartelsGolub method [2]. Subsequent stages are used to eliminate all the subdiagonal elements of U . As in the previous section, the elements u kk are available as the elements d k , but u k Gamma1;k must be evaluated when needed by a scalar product between row k Gamma 1 of the current S matrix and column k of A. Once ....
Bartels R.H. (1971), A stabilization of the simplex method, Numer. Math., 16, 414-434.
Bibliography on the Solution of Sparse Linear Systems and Related .. - Arantes (1997) (Correct)
No context found.
Bartels, R. H. A stabilization of the simplex method. Numer. Math., 16:414--434, 1971.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC