Dianne P. O'Leary  Home/Search
Context
Related
| umd.edu/pub/papers/pa...CSTR4023.ps.Z umd.edu/Library/TRs/C...CSTR4023.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: umd.edu/TRs/TR (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The efficiency and effectiveness of most optimization algorithms hinges on the numerical linear algebra algorithms that they utilize. Effective linear algebra is crucial to their success, and because of this, optimization applications have motivated fundamental advances in numerical linear algebra. This essay will highlight contributions of numerical linear algebra to optimization, as well as some optimization problems encountered within linear algebra that contribute to a symbiotic... (Update)
Active bibliography (related documents): More All
0.7: Adaptive Use of Iterative Methods in Predictor-Corrector.. - Wang, O'Leary (1999) (Correct)
0.7: Keith On . . . - Numerical Analysis Schubert (Correct)
0.7: Optimization By Direct Search In Matrix Computations - Higham (1993) (Correct)
Similar documents based on text: More All
0.3: Electronic Compass Design using KMZ51 and KMZ52 - Stork (Correct)
0.2: When Modified Gram-Schmidt Generates a Well-Conditioned Set.. - Giraud, Langou (2001) (Correct)
0.1: Randomization and the Parallel Solution of Linear Algebra Problems - Corso (1994) (Correct)
BibTeX entry: (Update)
@misc{ o'leary-symbiosis,
author = "Dianne P. O'Leary",
title = "Symbiosis between Linear Algebra and Optimization",
url = "citeseer.ist.psu.edu/223627.html" }
Citations (may not include all citations):1291 The Nature of Statistical Learning Theory (context) - Vapnik - 1995
686 Practical Methods of Optimization (context) - Fletcher - 1987
532 LAPACK Users' Guide (context) - Anderson, Bai et al. - 1992
530 Linear and Nonlinear Programming (context) - Luenberger - 1984
510 Robust Statistics (context) - Huber - 1981
482 Iterative Solution of Nonlinear Equations in Several Variabl.. (context) - Ortega, Rheinboldt - 1970
448 A new polynomial-time algorithm for linear programming (context) - Karmarkar - 1984
431 A tutorial on support vector machines for pattern recognitio.. - Burges - 1998
401 An Introduction to Wavelets (context) - Chui - 1992
372 Matrix Iterative Analysis (context) - Varga - 1962
346 Computer Solution of Large Sparse Positive Definite Systems (context) - George, Liu - 1981
322 Direct Methods for Sparse Matrices (context) - Duff, Erisman et al. - 1986
318 Methods of conjugate gradients for solving linear systems (context) - Hestenes, Stiefel - 1952
276 Linear Programming and Extensions (context) - Dantzig - 1963
267 The Linear Complementarity Problem (context) - Cottle, Pang et al. - 1992
258 Golub and Charles F (context) - Gene - 1996
234 Accuracy and Stability of Numerical Algorithms (context) - Higham - 1996
203 Solving Least Squares Problems (context) - Lawson, Hanson - 1974
176 Inexact Newton methods (context) - Dembo, Eisenstat et al. - 1982
126 Numerical Methods for Least Squares Problems (context) - Bjorck - 1996
85 Path-following methods for linear programming (context) - Gonzaga - 1992
71 Displacement structure: Theory and applications - Kailath, Sayed - 1995
68 Interior point methods for linear programming: Computational.. (context) - Lustig, Marsten et al. - 1994
67 Applications of secondorder cone programming (context) - Lobo, Vandenberghe et al. - 1998
64 Interior methods for constrained optimization - Wright - 1992
62 Robust estimation of a location parameter (context) - Huber - 1964
60 Updating quasi-Newton matrices with limited storage (context) - Nocedal - 1980
59 Sequential quadratic programming - Boggs, Tolle - 1995
57 Eigenvalue optimization - Lewis, Overton - 1996
56 Implementation of interior point methods for large scale lin.. - Andersen, Gondzio et al. - 1996
56 Function minimization by conjugate gradients (context) - Fletcher, Reeves - 1964
53 A polynomial algorithm in linear programming (context) - Khachian - 1979
52 Solving sparse linear systems with sparse backward error (context) - Arioli, Demmel et al. - 1989
49 Linear and Nonlinear Programming (context) - Murty - 1988
45 How good is the simplex algorithm (context) - Klee, Minty - 1972
44 Direct methods for solving symmetric indefinite systems of l.. (context) - Bunch, Parlett - 1971
41 Theory of algorithms for unconstrained optimization - Nocedal - 1992
40 motivation and theory (context) - Dennis, Jorge et al. - 1977
36 Preconditioning of truncated-Newton methods (context) - Nash - 1985
33 Computing gradients in large-scale optimization using automa.. - Bischof, Bouaricha et al. - 1997
29 Computational results of an interior point algorithm for lar.. (context) - Karmarkar, Ramakrishnan - 1991
27 Algorithms for VLSI Processor Arrays (context) - Kung, Leiserson - 1980
22 A discrete Newton algorithm for minimizing a function of man.. (context) - O'Leary - 1982
22 the early history of the singular value decomposition - Stewart - 1993
19 Interior Point Methods of Mathematical Programming (context) - Terlaky - 1996
19 Implementation of affine scaling methods: Approximate soluti.. (context) - Mehrotra - 1992
18 Stability of symmetric illconditioned systems arising in int.. (context) - Forsgren, Gill et al. - 1996
17 Fast Toeplitz orthogonalization (context) - Sweet - 1984
17 A QMR-based interior-point algorithm for solving linear prog.. - Freund, Jarre - 1995
16 Numerical methods for solving least squares problems (context) - Golub - 1965
15 Pattern recognition using generalized portrait (context) - Vapnik, Lerner - 1963
15 Fast Toeplitz orthogonalization using inner products (context) - Cybenko - 1987
15 Loss and recapture of orthogonality in the modified Gram--Sc.. (context) - Bjorck, Paige - 1992
15 Theoria combinationis observationum erroribus minimis obnoxi.. (context) - Gauss
15 Theoria combinationis observationum erroribus minimis obnoxi.. (context) - Gauss
14 Decomposition of a symmetric matrix (context) - Bunch, Kaufman et al. - 1976
14 Adaptive use of iterative methods in interior point methods .. - Wang, O'Leary - 1995
11 Error analysis of the Bjorck-Pereyra algorithms for solving .. (context) - Higham - 1987
11 The Simplex method of linear programming using LU decomposit.. (context) - Bartels, Golub - 1969
11 An interior point method for quadratic programs based on con.. (context) - Carpenter, Shanno - 1993
11 Row-action methods for huge and sparse systems and their app.. (context) - Censor - 1981
11 Robust regression computation using iteratively reweighted l.. (context) - O'Leary - 1990
11 A truncated primal-infeasible dual-feasible network interior.. - Portugal, Resende et al. - 1994
9 Fast orthogonal decomposition of rank deficient Toeplitz mat.. (context) - Hansen, Gesmar - 1993
8 Historical development of the Newton-Raphson method (context) - Ypma - 1995
8 Solution of Vandermonde system of equations (context) - Bjorck, Pereyra - 1970
7 On rank-revealing factorisations (context) - Chandrasekaran, Ipsen - 1994
7 Gigaflops in linear programming (context) - Lustig, Rothberg - 1995
7 Interior point methods for linear and nonlinear programming (context) - Shanno, Simantiraki - 1997
7 The least squares problem and pseudoinverses (context) - Peters, Wilkinson - 1970
6 Fast and accurate triangularization of Toeplitz matrices (context) - Park, Eld'en - 1993
5 Algorithm 777: Hompack90: A suite of Fortran 90 codes for gl.. (context) - Watson, Sosonkina et al. - 1997
5 A note on the least squares solution of a band system of lin.. (context) - Reid - 1967
5 Adaptive use of iterative methods in predictor-corrector int.. - Wang, O'Leary - 1999
5 Fast QR factorization of Vandermonde matrices (context) - Demeure - 1989
5 A constructive proof of the Brouwer fixed-point theorem and .. (context) - Kellogg, Li et al. - 1976
4 Toeplitz Least Squares Computations (context) - Nagy - 1991
4 Cholesky-based methods for sparse least squares: the benefit.. (context) - Saunders - 1996
4 Perturbation theory for pseudo-inverses (context) - Wedin - 1973
4 Methods for nonlinear constraints in optimization calculatio.. - Conn, Gould et al. - 1997
4 Theory of the Combination of Observations Least Subject to E.. (context) - Gauss - 1995
3 The least squares solution of overdetermined linear equation.. (context) - Cox - 1981
3 Iterative methods for the augmented equations in large-scale.. (context) - Chin, Vannelli - 1994
3 A modified Schur-complement method for handling dense column.. (context) - Anderson - 1996
3 Mathematical Programming with Data Perturbations (context) - Fiacco - 1998
2 Algorithms for confluent Vandermonde systems (context) - Bjorck, Elfving - 1973
2 Aspects of the numerical analysis of neural networks (context) - Ellacott - 1994
2 ere. Note sur la convergence de methodes de directions conju.. (context) - Polak, Ribi - 1969
2 BFGS with update skipping and varying memory - Kolda, O'Leary et al. - 1998
2 Modifying pivot elements in Gaussian elimination (context) - Stewart - 1974
1 A stablization of the simplex method (context) - Bartels - 1971
1 Forward: Special issue on semidefinite programming (context) - Overton, Wolkowicz - 1997
1 Oak Ridge National Laboratory (context) - project
1 Oxon OX14 3ED (context) - library, Office
1 Optimization techniques in linear regression: A review (context) - Narula - 1982
Documents on the same site (http://www.cs.umd.edu/TRs/TR.html): More
Adaptive Use of Iterative Methods in Predictor-Corrector.. - Wang, O'Leary (1999) (Correct)
Near-Optimal Parameters for Tikhonov and Other Regularization.. - O'Leary (1999) (Correct)
Computation and Uses of the Semidiscrete Matrix Decomposition - Kolda, O'Leary (1999) (Correct)
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