Algorithms for Convex Optimization

9.5 Newton’s method as steepest descent 171 9.6 Analysis based on a local norm 176. vi Contents 9.7 Analysis based on the Euclidean norm 181 9.8 Exercises 183 10 An Interior Point Method for Linear Programming 186 10.1 Linear programming 186 10.2 Constrained optimization via barrier functions 188

Tags:

  Descent, Steepest descent, Steepest

Information

Related documents

Numerical Optimization - University of California, Irvine

www.math.uci.edu

This is pag Printer: O Jorge Nocedal Stephen J. Wright EECS Department Computer Sciences Department Northwestern University University of Wisconsin

  Numerical, Optimization, Numerical optimization

Iterative Methods for Sparse Linear Systems

web.stanford.edu

Iterative methods for solving general, large sparse linear systems have been gaining popularity in many areas of scientific computing. Until recently, direct solution methods

  System, Linear, Methods, Arsesp, Methods for sparse linear systems

Related search queries