Result 21 to 40 of 80 total
Developing an evaluation methodology for ICT supported learning: enhancing and promoting quality through ’change knowledge’ (English)
Quality Education @ a Distance, 203-210 (2003).
21
SNOPT: An SQP algorithm for large-scale constrained optimization. (English)
SIAM J. Optim. 12, No.4, 979-1006 (2002).
22
SNOPT: an SQP algorithm for large-scale constrained optimization (English)
SIAM Journal on Optimization 12, No. 4, 979-1006 (2002).
23
Issues in the organisational and change context for innovations using ICT in higher education (English)
TelE-Learning, 193-200 (2002).
24
Efficient exploration of conformational space using the stochastic search method: Application to -peptide oligomers. (English)
J. Comput. Chem. 22, No. 14, 1646-1654 (2001).
25
‘Bridging tools’ for change: Evaluating a collaborative learning network. (English)
Journal of Computer Assisted Learning 17, No.3, 295-305 (2001).
26
Atomic decomposition by basis pursuit. (English)
SIAM Rev. 43, No.1, 129-159 (2001).
27
’Bridging tools’ for change: evaluating a collaborative learning network (English)
J. Comp. Assisted Learning 17, No. 3, 295-305 (2001).
28
Atomic decomposition by basis pursuit. (English)
SIAM J. Sci. Comput. 20, No.1, 33-61 (1999).
29
Organisational culture: electronic support for occupational learning (English)
J. Comp. Assisted Learning 14, No. 3, 170-182 (1998).
30
Computing projections with LSQR. (English)
BIT 37, No.1, 96-104 (1997).
31
Cholesky-based methods for sparse least squares: The benefits of regularization. (English)
Adams, Loyce (ed.) et al., Linear and nonlinear conjugate gradient-related methods. Proceedings of the AMS-IMS-SIAM summer research conference, Washington, DC, USA, July 9‒13, 1995. Philadelphia, PA: SIAM. 92-100 (1996).
32
On the stability of Cholesky factorization for symmetric quasidefinite systems. (English)
SIAM J. Matrix Anal. Appl. 17, No.1, 35-46 (1996).
33
Solution of sparse rectangular systems using LSQR and Craig. (English)
BIT 35, No.4, 588-604 (1995).
34
A practical interior-point method for convex programming. (English)
SIAM J. Optim. 5, No.1, 149-171 (1995).
35
Solving reduced KKT systems in barrier methods for linear programming. (English)
Griffiths, D. F. (ed.) et al., Numerical analysis 1993. Proceedings of the 15th Dundee biennial conference on numerical analysis held at the University of Dundee (United Kingdom), June 29- July 2, 1993. Harlow: Longman Scientific \& Technical. Pitman Res. Notes Math. Ser. 303, 89-104 (1994).
36
Sheaves in geometry and logic: a first introduction to topos theory. (English)
Universitext. New York etc.: Springer-Verlag. xii, 627 p. (1992).
37
Preconditioners for indefinite systems arising in optimization. (English)
SIAM J. Matrix Anal. Appl. 13, No.1, 292-311 (1992).
38
A block-$LU$ update for large-scale linear programming. (English)
SIAM J. Matrix Anal. Appl. 13, No.1, 191-201 (1992).
39
Inertia-controlling methods for general quadratic programming. (English)
SIAM Rev. 33, No.1, 1-36 (1991).
40
Result 21 to 40 of 80 total
Start
Contact
Print
General Help
