We review some of the principal linear algebraic issuesassociated with the design of modern optimizationalgorithms. Much of the discussion will concern the useof direct and iterative linear solvers for large-scaleoptimization. Particular emphasis will be given to somerecent developments in the use of regularization.