Satisfying Flux Balance and Mass-Action Kinetics in a Network of Biochemical Reactions

Size: px
Start display at page:

Download "Satisfying Flux Balance and Mass-Action Kinetics in a Network of Biochemical Reactions"

Transcription

1 Satisfying Flux Balance and Mass-Action Kinetics in a Network of Biochemical Reactions Speakers Senior Personnel Collaborators Michael Saunders and Ines Thiele Ronan Fleming, Bernhard Palsson, Yinyu Ye Santiago Akle, Onkar Dalal, Joshua Lerman, Yuekai Sun, Nicole Taheri ICME Systems Biology Research Group Center for Systems Biology Stanford University University of California, San Diego University of Iceland Genomic Sciences Annual PI Meeting Hyatt Regency Crystal City, VA April 1013, 2011 Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 1/19

2 Abstract Computational modeling of biochemical reaction networks will become increasingly dependent on large-scale numerical optimization as the network dimensionality continues to rise. Linear optimization, the mainstay for ux balance analysis, is trivial for well scaled metabolic models, but nontrivial for integrated metabolic and macromolecular synthetic networks because of the size of the stoichiometric matrix and the wide temporal scales involved. We describe the rst such reconstruction for E. coli, which accounts for 43% of all its genes, and a similar reconstruction for T. maritima as well as numerical challenges associated with ux balance analysis. Beyond linear optimization, we have established that a sequence of parametric convex optimizations can be used to model the inherently nonlinear kinetic relationship between reaction ux and metabolite concentration. Convex optimization preserves many of the attractive numerical features of linear optimization algorithms. For example, given a model of a biochemical network, one can establish a priori whether a solution will exist. The non-existence of a solution is an indication of a malformed model arising from incorrect stoichiometry, reaction directionality, etc. Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 2/19

3 Abstract, contd With a sequence of convex optimization problems, establishing the existence of a xed point for such a sequence is equally important for indicating when a model is malformed. We summarize recent results establishing necessary conditions for existence of a ux and concentration at such a xed point. The approach also leads to a numerically tractable algorithm for simultaneous satisfaction of ux balance and mass-action kinetics for a well scaled stoichiometric model, subject to certain conditions. The overall objective of this work is to provide the systems biology community with a new wave of computationally ecient algorithms for physico-chemically realistic modeling of genome-scale biochemical networks. We highlight open source algorithms already released. Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 3/19

4 1 Flux Balance Analysis LP problem 2 Entropy problem 3 Reformulation of Sv f Sv r = 0 Parameterized Entropy problem Sequence of Entropy problems 4 LUSOL Other solvers Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 4/19

5 Flux Balance Analysis LP problem Leads to linear programming problems involving the stoichiometric matrix S (Palsson 2006): minimize v f, v r, v e d T v e subject to Sv f Sv r + S e v e = 0 v f, v r 0, l v e u Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 5/19

6 Flux Balance Analysis LP problem Leads to linear programming problems involving the stoichiometric matrix S (Palsson 2006): minimize v f, v r, v e d T v e subject to Sv f Sv r + S e v e = 0 v f, v r 0, l v e u Treat as a challenging large-scale linear program: minimize x d T x subject to Ax = b, l x u Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 5/19

7 LP problem Badly scaled stoichiometric constraints When modeling biological systems, we often encounter reactions with large coecients: A B C + D We replace these reactions with a sequence of reactions A ˆB 2 C + D 100 ˆB 1 ˆB 2 100B ˆB 1 Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 6/19

8 Badly scaled coupling constraints LP problem Recently, reaction coupling has been used to represent dependencies between synthesis and utilization [Thiele et al., Biophys. J., 98(10), 2072 (2010)]: α v 1 v 2 β Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 7/19

9 Badly scaled coupling constraints LP problem Recently, reaction coupling has been used to represent dependencies between synthesis and utilization [Thiele et al., Biophys. J., 98(10), 2072 (2010)]: These are linear constraints: α v 1 v 2 β αv 2 v 1 0 v 1 βv 2 0 Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 7/19

10 Badly scaled coupling constraints LP problem Recently, reaction coupling has been used to represent dependencies between synthesis and utilization [Thiele et al., Biophys. J., 98(10), 2072 (2010)]: These are linear constraints: α v 1 v 2 β αv 2 v 1 0 v 1 βv 2 0 We replace v v 2 0 by a sequence of constraints: v 1 100s 1 0 s 1 100s 2 0 s 2 100v 2 0 Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 7/19

11 Example data Flux Balance Analysis LP problem Ax = b Organism Problem Dimensions T. maritima ME_ E. coli ME_ E. coli ME_ CPLEX simplex and barrier LP solvers applied with Feasibility and Optimality tolerances 10 9 Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 8/19

12 Experimental results LP problem CPLEX simplex solver original with rebuild Problem b Ax 1 Time b Ax 1 Time TM EC EC Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 9/19

13 Experimental results LP problem CPLEX simplex solver original with rebuild Problem b Ax 1 Time b Ax 1 Time TM EC EC CPLEX barrier solver original with rebuild Problem b Ax 1 Time b Ax 1 Time TM EC EC Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 9/19

14 LP problem Implications for Flux Balance Analysis Our procedure addresses the numerical diculties associated with badly scaled linear systems that arise in systems biology Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 10/19

15 LP problem Implications for Flux Balance Analysis Our procedure addresses the numerical diculties associated with badly scaled linear systems that arise in systems biology Users can more accurately model biological systems by enforcing ill-scaled constraints Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 10/19

16 LP problem Implications for Flux Balance Analysis Our procedure addresses the numerical diculties associated with badly scaled linear systems that arise in systems biology Users can more accurately model biological systems by enforcing ill-scaled constraints Remember to switch o the CPLEX Presolve Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 10/19

17 LP problem Implications for Flux Balance Analysis Our procedure addresses the numerical diculties associated with badly scaled linear systems that arise in systems biology Users can more accurately model biological systems by enforcing ill-scaled constraints Remember to switch o the CPLEX Presolve A further card up sleeve: 128-bit f90 version of SQOPT Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 10/19

18 LP problem Implications for Flux Balance Analysis Our procedure addresses the numerical diculties associated with badly scaled linear systems that arise in systems biology Users can more accurately model biological systems by enforcing ill-scaled constraints Remember to switch o the CPLEX Presolve A further card up sleeve: 128-bit f90 version of SQOPT Avoiding large numbers in S is essential for rank estimation (e.g. to evaluate conserved moieties correctly) Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 10/19

19 Entropy problem Entropy problem with parameter p minimize v f, v r>0 v T f (log v f + p e) + v T r (log v r + p e) subject to Sv f Sv r = b : y Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 11/19

20 Entropy problem Entropy problem with parameter p minimize v f, v r>0 v T f (log v f + p e) + v T r (log v r + p e) subject to Sv f Sv r = b : y Optimality condition S T y log(v r./ v f ) Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 11/19

21 Entropy problem Entropy problem with parameter p minimize v f, v r>0 v T f (log v f + p e) + v T r (log v r + p e) subject to Sv f Sv r = b : y Optimality condition S T y log(v r./ v f ) Optimal v f, v r are thermodynamically feasible First numerically scalable method (polynomial complexity) [Fleming et al., A variational principle for computing nonequilibrium uxes and potentials in genome-scale biochemical networks, 2011] Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 11/19

22 Reformulation of Sv f Sv r = 0 Parameterized Entropy problem Sequence of Entropy problems Homogeneous network (stepping stone to b 0) [ ] [ ] v S S f = 0 S R F v r Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 12/19

23 Reformulation of Sv f Sv r = 0 Parameterized Entropy problem Sequence of Entropy problems Homogeneous network (stepping stone to b 0) [ ] [ ] v S S f = 0 S R F v r (R F )v f = (R F )v r v f = diag (k f ) v r =... i cf i1 i. i cf in i Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 12/19

24 Reformulation of Sv f Sv r = 0 Parameterized Entropy problem Sequence of Entropy problems Homogeneous network (stepping stone to b 0) [ ] [ ] v S S f = 0 S R F v r (R F )v f = (R F )v r v f = diag (k f ) v r =... F v r + Rv f = F v f + Rv r v(c) = i cf i1 i. i cf in i i cy i1 i. i cy in i Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 12/19

25 Reformulation of Sv f Sv r = 0 Parameterized Entropy problem Sequence of Entropy problems Homogeneous network (stepping stone to b 0) [ ] [ ] v S S f = 0 S R F v r (R F )v f = (R F )v r v f = diag (k f ) v r =... F v r + Rv f = F v f + Rv r v(c) = i cf i1 i. i cf in i i cy i1 i. i cy in i Y A T v(c) = Y Dv(c) log v(c) = Y T log c Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 12/19

26 Reformulation of Sv f Sv r = 0 Parameterized Entropy problem Sequence of Entropy problems We want Y Dv = Y A T v and Y T log c = log v Entropy problem with parameter µ minimize v>0 v T D log v e T Dv subject to Y Dv = µ : y Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 13/19

27 Reformulation of Sv f Sv r = 0 Parameterized Entropy problem Sequence of Entropy problems We want Y Dv = Y A T v and Y T log c = log v Entropy problem with parameter µ minimize v>0 v T D log v e T Dv subject to Y Dv = µ : y Optimality condition DY T y(µ) = D log v(µ) Y T y(µ) = log v(µ) Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 13/19

28 Reformulation of Sv f Sv r = 0 Parameterized Entropy problem Sequence of Entropy problems We want Y Dv = Y A T v and Y T log c = log v Entropy problem with parameter µ minimize v>0 v T D log v e T Dv subject to Y Dv = µ : y Optimality condition DY T y(µ) = D log v(µ) Y T y(µ) = log v(µ) We would like the xed point condition µ = Y A T v(µ) Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 13/19

29 Reformulation of Sv f Sv r = 0 Parameterized Entropy problem Sequence of Entropy problems Fixed point iteration v v 0 µ Y A T v while Y Dv Y A T v > τ do Solve Entropy subproblem min v T D log v e T Dv st Y Dv = µ end µ (1 θ)µ + θy A T v Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 14/19

30 Fixed point iteration, θ = 0.5 Reformulation of Sv f Sv r = 0 Parameterized Entropy problem Sequence of Entropy problems Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 15/19

31 LUSOL: A sparse LU package LUSOL Other solvers Factorize m n sparse matrix S = LDU with permutations to preserve stability and sparsity L and U triangular L ii = 1, D diagonal, U ii = 1 Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 16/19

32 LUSOL: A sparse LU package LUSOL Other solvers Factorize m n sparse matrix S = LDU with permutations to preserve stability and sparsity L and U triangular L ii = 1, D diagonal, U ii = 1 Uses: Find rank(s) < m < n Remove redundant rows Form nullspace basis Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 16/19

33 LUSOL: A sparse LU package LUSOL Other solvers Factorize m n sparse matrix S = LDU with permutations to preserve stability and sparsity L and U triangular L ii = 1, D diagonal, U ii = 1 Uses: Find rank(s) < m < n Remove redundant rows Form nullspace basis Threshold partial pivoting keeps L well-conditioned L ij Ltol (5.0 or 2.0 say) Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 16/19

34 LUSOL: A sparse LU package LUSOL Other solvers Factorize m n sparse matrix S = LDU with permutations to preserve stability and sparsity L and U triangular L ii = 1, D diagonal, U ii = 1 Uses: Find rank(s) < m < n Remove redundant rows Form nullspace basis Threshold partial pivoting keeps L well-conditioned L ij Ltol (5.0 or 2.0 say) Threshold rook pivoting controls L and U L ij and U ij Ltol (2.0 or 1.5 say) Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 16/19

35 LUSOL Other solvers Stoichiometric matrix (rank-decient) 2 S = Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 17/19

36 LUSOL Other solvers Stoichiometric matrix (rank-decient) 2 S = SVD S = UDV T U, V orthogonal D = ɛ 1 Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 17/19

37 LUSOL Other solvers Stoichiometric matrix (rank-decient) 2 S = SVD S = UDV T U, V orthogonal D = ɛ 1 LUSOL with threshold rook pivoting Ltol= S = LDU = ɛ x x x Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 17/19

38 LUSOL Other solvers LUSOL with rook pivoting and reducing Ltol Sorted elements of D: SVD ɛ Ltol ɛ ɛ ɛ Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 18/19

39 Available software LUSOL Other solvers LUSOL: Fortran 77, C, f90 coming New Matlab mex interface (Nick Henderson, ICME, Stanford) Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 19/19

40 Available software LUSOL Other solvers LUSOL: Fortran 77, C, f90 coming New Matlab mex interface (Nick Henderson, ICME, Stanford) Nullspace functions: Compute products p = Zv or q = Z T y, where S T Z = 0 Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 19/19

41 Available software LUSOL Other solvers LUSOL: Fortran 77, C, f90 coming New Matlab mex interface (Nick Henderson, ICME, Stanford) Nullspace functions: Compute products p = Zv or q = Z T y, where S T Z = 0 PDCO: Matlab Barrier method for LP and Entropy problems Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 19/19

42 Available software LUSOL Other solvers LUSOL: Fortran 77, C, f90 coming New Matlab mex interface (Nick Henderson, ICME, Stanford) Nullspace functions: Compute products p = Zv or q = Z T y, where S T Z = 0 PDCO: Matlab Barrier method for LP and Entropy problems MINRES, SYMMLQ, LSQR, LSMR: f77, f90, Matlab Iterative solvers for Ax = b, min Ax b Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 19/19

43 Available software LUSOL Other solvers LUSOL: Fortran 77, C, f90 coming New Matlab mex interface (Nick Henderson, ICME, Stanford) Nullspace functions: Compute products p = Zv or q = Z T y, where S T Z = 0 PDCO: Matlab Barrier method for LP and Entropy problems MINRES, SYMMLQ, LSQR, LSMR: f77, f90, Matlab Iterative solvers for Ax = b, min Ax b SQOPT, SNOPT: f77, f90 coming General-purpose solvers for LP, QP, NLP Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 19/19

44 Available software LUSOL Other solvers LUSOL: Fortran 77, C, f90 coming New Matlab mex interface (Nick Henderson, ICME, Stanford) Nullspace functions: Compute products p = Zv or q = Z T y, where S T Z = 0 PDCO: Matlab Barrier method for LP and Entropy problems MINRES, SYMMLQ, LSQR, LSMR: f77, f90, Matlab Iterative solvers for Ax = b, min Ax b SQOPT, SNOPT: f77, f90 coming General-purpose solvers for LP, QP, NLP Systems Optimization Laboratory Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 19/19

45 Available software LUSOL Other solvers LUSOL: Fortran 77, C, f90 coming New Matlab mex interface (Nick Henderson, ICME, Stanford) Nullspace functions: Compute products p = Zv or q = Z T y, where S T Z = 0 PDCO: Matlab Barrier method for LP and Entropy problems MINRES, SYMMLQ, LSQR, LSMR: f77, f90, Matlab Iterative solvers for Ax = b, min Ax b SQOPT, SNOPT: f77, f90 coming General-purpose solvers for LP, QP, NLP Systems Optimization Laboratory and more (COBRA Toolbox and extensions) Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 19/19

A convex QP solver based on block-lu updates

A convex QP solver based on block-lu updates Block-LU updates p. 1/24 A convex QP solver based on block-lu updates PP06 SIAM Conference on Parallel Processing for Scientific Computing San Francisco, CA, Feb 22 24, 2006 Hanh Huynh and Michael Saunders

More information

MS&E 318 (CME 338) Large-Scale Numerical Optimization

MS&E 318 (CME 338) Large-Scale Numerical Optimization Stanford University, Management Science & Engineering (and ICME MS&E 38 (CME 338 Large-Scale Numerical Optimization Course description Instructor: Michael Saunders Spring 28 Notes : Review The course teaches

More information

A review of sparsity vs stability in LU updates

A review of sparsity vs stability in LU updates A review of sparsity vs stability in LU updates Michael Saunders Dept of Management Science and Engineering (MS&E) Systems Optimization Laboratory (SOL) Institute for Computational Mathematics and Engineering

More information

Implementation of a KKT-based active-set QP solver

Implementation of a KKT-based active-set QP solver Block-LU updates p. 1/27 Implementation of a KKT-based active-set QP solver ISMP 2006 19th International Symposium on Mathematical Programming Rio de Janeiro, Brazil, July 30 August 4, 2006 Hanh Huynh

More information

LUSOL: A basis package for constrained optimization

LUSOL: A basis package for constrained optimization LUSOL: A basis package for constrained optimization IFORS Triennial Conference on OR/MS Honolulu, HI, July 11 15, 2005 Michael O Sullivan and Michael Saunders Dept of Engineering Science Dept of Management

More information

MS&E 318 (CME 338) Large-Scale Numerical Optimization

MS&E 318 (CME 338) Large-Scale Numerical Optimization Stanford University, Management Science & Engineering (and ICME MS&E 318 (CME 338 Large-Scale Numerical Optimization 1 Origins Instructor: Michael Saunders Spring 2018 Notes 7: LUSOL: a Basis Factorization

More information

Experiments with iterative computation of search directions within interior methods for constrained optimization

Experiments with iterative computation of search directions within interior methods for constrained optimization Experiments with iterative computation of search directions within interior methods for constrained optimization Santiago Akle and Michael Saunders Institute for Computational Mathematics and Engineering

More information

Ax=b. Zack 10/4/2013

Ax=b. Zack 10/4/2013 Ax=b Zack 10/4/2013 Iteration method Ax=b v 1, v 2 x k = V k y k Given (A, b) standard orthonormal base v 1, v 2 x k = V k y k For symmetric A, the method to generate V k is called Lanczos Method Lanczos

More information

SMO vs PDCO for SVM: Sequential Minimal Optimization vs Primal-Dual interior method for Convex Objectives for Support Vector Machines

SMO vs PDCO for SVM: Sequential Minimal Optimization vs Primal-Dual interior method for Convex Objectives for Support Vector Machines vs for SVM: Sequential Minimal Optimization vs Primal-Dual interior method for Convex Objectives for Support Vector Machines Ding Ma Michael Saunders Working paper, January 5 Introduction In machine learning,

More information

MS&E 318 (CME 338) Large-Scale Numerical Optimization

MS&E 318 (CME 338) Large-Scale Numerical Optimization Stanford University, Management Science & Engineering (and ICME) MS&E 318 (CME 338) Large-Scale Numerical Optimization Instructor: Michael Saunders Spring 2015 Notes 4: The Primal Simplex Method 1 Linear

More information

Computationally efficient flux variability analysis

Computationally efficient flux variability analysis Computationally efficient flux variability analysis Steinn Gudmundsson 1 and Ines Thiele 1,2 1 Center for Systems Biology, University of Iceland, Reykjavik, Iceland 2 Faculty of Industrial Engineering,

More information

Outline Introduction: Problem Description Diculties Algebraic Structure: Algebraic Varieties Rank Decient Toeplitz Matrices Constructing Lower Rank St

Outline Introduction: Problem Description Diculties Algebraic Structure: Algebraic Varieties Rank Decient Toeplitz Matrices Constructing Lower Rank St Structured Lower Rank Approximation by Moody T. Chu (NCSU) joint with Robert E. Funderlic (NCSU) and Robert J. Plemmons (Wake Forest) March 5, 1998 Outline Introduction: Problem Description Diculties Algebraic

More information

Sparse Rank-Revealing LU Factorization

Sparse Rank-Revealing LU Factorization Sparse Rank-Revealing LU Factorization SIAM Conference on Optimization Toronto, May 2002 Michael O Sullivan and Michael Saunders Dept of Engineering Science Dept of Management Sci & Eng University of Auckland

More information

Sparse Rank-Revealing LU Factorization

Sparse Rank-Revealing LU Factorization Sparse Rank-Revealing LU Factorization Householder Symposium XV on Numerical Linear Algebra Peebles, Scotland, June 2002 Michael O Sullivan and Michael Saunders Dept of Engineering Science Dept of Management

More information

arxiv: v3 [q-bio.mn] 20 Oct 2011

arxiv: v3 [q-bio.mn] 20 Oct 2011 arxiv:1105.2359v3 [q-bio.mn] 20 Oct 2011 Existence of Positive Steady States for Mass Conserving and Mass-Action Chemical Reaction Networks with a Single Terminal-Linkage Class Santiago Akle Onkar Dalal

More information

MS&E 318 (CME 338) Large-Scale Numerical Optimization

MS&E 318 (CME 338) Large-Scale Numerical Optimization Stanford University, Management Science & Engineering (and ICME) MS&E 318 (CME 338) Large-Scale Numerical Optimization Instructor: Michael Saunders Spring 2015 Notes 11: NPSOL and SNOPT SQP Methods 1 Overview

More information

V15 Flux Balance Analysis Extreme Pathways

V15 Flux Balance Analysis Extreme Pathways V15 Flux Balance Analysis Extreme Pathways Stoichiometric matrix S: m n matrix with stochiometries of the n reactions as columns and participations of m metabolites as rows. The stochiometric matrix is

More information

Introduction to Mathematical Programming

Introduction to Mathematical Programming Introduction to Mathematical Programming Ming Zhong Lecture 6 September 12, 2018 Ming Zhong (JHU) AMS Fall 2018 1 / 20 Table of Contents 1 Ming Zhong (JHU) AMS Fall 2018 2 / 20 Solving Linear Systems A

More information

Revised Simplex Method

Revised Simplex Method DM545 Linear and Integer Programming Lecture 7 Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. 2. 2 Motivation Complexity of single pivot operation

More information

MS&E 318 (CME 338) Large-Scale Numerical Optimization

MS&E 318 (CME 338) Large-Scale Numerical Optimization Stanford University, Management Science & Engineering (and ICME) MS&E 318 (CME 338) Large-Scale Numerical Optimization 1 Origins Instructor: Michael Saunders Spring 2015 Notes 9: Augmented Lagrangian Methods

More information

Nonlinear Optimization for Optimal Control

Nonlinear Optimization for Optimal Control Nonlinear Optimization for Optimal Control Pieter Abbeel UC Berkeley EECS Many slides and figures adapted from Stephen Boyd [optional] Boyd and Vandenberghe, Convex Optimization, Chapters 9 11 [optional]

More information

Variational Bayesian Inference Techniques

Variational Bayesian Inference Techniques Advanced Signal Processing 2, SE Variational Bayesian Inference Techniques Johann Steiner 1 Outline Introduction Sparse Signal Reconstruction Sparsity Priors Benefits of Sparse Bayesian Inference Variational

More information

MS&E 318 (CME 338) Large-Scale Numerical Optimization. 1 Interior methods for linear optimization

MS&E 318 (CME 338) Large-Scale Numerical Optimization. 1 Interior methods for linear optimization Stanford University, Management Science & Engineering and ICME MS&E 318 CME 338 Large-Scale Numerical Optimization Instructor: Michael Saunders Spring 017 Notes 9: PDCO: Primal-Dual Interior Methods 1

More information

A REGULARIZED ACTIVE-SET METHOD FOR SPARSE CONVEX QUADRATIC PROGRAMMING

A REGULARIZED ACTIVE-SET METHOD FOR SPARSE CONVEX QUADRATIC PROGRAMMING A REGULARIZED ACTIVE-SET METHOD FOR SPARSE CONVEX QUADRATIC PROGRAMMING A DISSERTATION SUBMITTED TO THE INSTITUTE FOR COMPUTATIONAL AND MATHEMATICAL ENGINEERING AND THE COMMITTEE ON GRADUATE STUDIES OF

More information

Large-scale Linear and Nonlinear Optimization in Quad Precision

Large-scale Linear and Nonlinear Optimization in Quad Precision Large-scale Linear and Nonlinear Optimization in Quad Precision Ding Ma and Michael Saunders MS&E and ICME, Stanford University US-Mexico Workshop on Optimization and its Applications Mérida, Yucatán,

More information

Convex Quadratic Approximation

Convex Quadratic Approximation Convex Quadratic Approximation J. Ben Rosen 1 and Roummel F. Marcia 2 Abstract. For some applications it is desired to approximate a set of m data points in IR n with a convex quadratic function. Furthermore,

More information

Generalized MINRES or Generalized LSQR?

Generalized MINRES or Generalized LSQR? Generalized MINRES or Generalized LSQR? Michael Saunders Systems Optimization Laboratory (SOL) Institute for Computational Mathematics and Engineering (ICME) Stanford University New Frontiers in Numerical

More information

CME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 0

CME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 0 CME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 0 GENE H GOLUB 1 What is Numerical Analysis? In the 1973 edition of the Webster s New Collegiate Dictionary, numerical analysis is defined to be the

More information

A guideline to model reduction by stoichiometric decomposition for biochemical network analysis

A guideline to model reduction by stoichiometric decomposition for biochemical network analysis 21st International Symposium on Mathematical Theory of Networks and Systems July 7-11, 2014. A guideline to model reduction by stoichiometric decomposition for biochemical network analysis Steffen Waldherr

More information

9. Numerical linear algebra background

9. Numerical linear algebra background Convex Optimization Boyd & Vandenberghe 9. Numerical linear algebra background matrix structure and algorithm complexity solving linear equations with factored matrices LU, Cholesky, LDL T factorization

More information

Roundoff Error. Monday, August 29, 11

Roundoff Error. Monday, August 29, 11 Roundoff Error A round-off error (rounding error), is the difference between the calculated approximation of a number and its exact mathematical value. Numerical analysis specifically tries to estimate

More information

Stoichiometric vector and matrix

Stoichiometric vector and matrix Stoichiometric vector and matrix The stoichiometric coefficients of a reaction are collected to a vector s r In s r there is a one position for each metabolite in the metabolic system, and the stoichiometric

More information

What s New in Active-Set Methods for Nonlinear Optimization?

What s New in Active-Set Methods for Nonlinear Optimization? What s New in Active-Set Methods for Nonlinear Optimization? Philip E. Gill Advances in Numerical Computation, Manchester University, July 5, 2011 A Workshop in Honor of Sven Hammarling UCSD Center for

More information

MS&E 318 (CME 338) Large-Scale Numerical Optimization

MS&E 318 (CME 338) Large-Scale Numerical Optimization Stanford University, Management Science & Engineering (and ICME) MS&E 318 (CME 338) Large-Scale Numerical Optimization Instructor: Michael Saunders Spring 2017 Notes 10: MINOS Part 1: the Reduced-Gradient

More information

Bindel, Fall 2016 Matrix Computations (CS 6210) Notes for

Bindel, Fall 2016 Matrix Computations (CS 6210) Notes for 1 Logistics Notes for 2016-09-14 1. There was a goof in HW 2, problem 1 (now fixed) please re-download if you have already started looking at it. 2. CS colloquium (4:15 in Gates G01) this Thurs is Margaret

More information

Finding a point in the relative interior of a polyhedron

Finding a point in the relative interior of a polyhedron Report no. NA-07/01 Finding a point in the relative interior of a polyhedron Coralia Cartis Rutherford Appleton Laboratory, Numerical Analysis Group Nicholas I. M. Gould Oxford University, Numerical Analysis

More information

DM545 Linear and Integer Programming. Lecture 7 Revised Simplex Method. Marco Chiarandini

DM545 Linear and Integer Programming. Lecture 7 Revised Simplex Method. Marco Chiarandini DM545 Linear and Integer Programming Lecture 7 Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. 2. 2 Motivation Complexity of single pivot operation

More information

On Optimal Frame Conditioners

On Optimal Frame Conditioners On Optimal Frame Conditioners Chae A. Clark Department of Mathematics University of Maryland, College Park Email: cclark18@math.umd.edu Kasso A. Okoudjou Department of Mathematics University of Maryland,

More information

Scientific Computing

Scientific Computing Scientific Computing Direct solution methods Martin van Gijzen Delft University of Technology October 3, 2018 1 Program October 3 Matrix norms LU decomposition Basic algorithm Cost Stability Pivoting Pivoting

More information

1.Chapter Objectives

1.Chapter Objectives LU Factorization INDEX 1.Chapter objectives 2.Overview of LU factorization 2.1GAUSS ELIMINATION AS LU FACTORIZATION 2.2LU Factorization with Pivoting 2.3 MATLAB Function: lu 3. CHOLESKY FACTORIZATION 3.1

More information

Linear Programming: Simplex

Linear Programming: Simplex Linear Programming: Simplex Stephen J. Wright 1 2 Computer Sciences Department, University of Wisconsin-Madison. IMA, August 2016 Stephen Wright (UW-Madison) Linear Programming: Simplex IMA, August 2016

More information

Chapter 8 Structured Low Rank Approximation

Chapter 8 Structured Low Rank Approximation Chapter 8 Structured Low Rank Approximation Overview Low Rank Toeplitz Approximation Low Rank Circulant Approximation Low Rank Covariance Approximation Eculidean Distance Matrix Approximation Approximate

More information

Carbon labeling for Metabolic Flux Analysis. Nicholas Wayne Henderson Computational and Applied Mathematics. Abstract

Carbon labeling for Metabolic Flux Analysis. Nicholas Wayne Henderson Computational and Applied Mathematics. Abstract Carbon labeling for Metabolic Flux Analysis Nicholas Wayne Henderson Computational and Applied Mathematics Abstract Metabolic engineering is rapidly growing as a discipline. Applications in pharmaceuticals,

More information

1 Computing with constraints

1 Computing with constraints Notes for 2017-04-26 1 Computing with constraints Recall that our basic problem is minimize φ(x) s.t. x Ω where the feasible set Ω is defined by equality and inequality conditions Ω = {x R n : c i (x)

More information

Optimization Algorithms for Compressed Sensing

Optimization Algorithms for Compressed Sensing Optimization Algorithms for Compressed Sensing Stephen Wright University of Wisconsin-Madison SIAM Gator Student Conference, Gainesville, March 2009 Stephen Wright (UW-Madison) Optimization and Compressed

More information

Lecture: Algorithms for LP, SOCP and SDP

Lecture: Algorithms for LP, SOCP and SDP 1/53 Lecture: Algorithms for LP, SOCP and SDP Zaiwen Wen Beijing International Center For Mathematical Research Peking University http://bicmr.pku.edu.cn/~wenzw/bigdata2018.html wenzw@pku.edu.cn Acknowledgement:

More information

A short description of the QPS-Reader and numerical results obtained with qipp

A short description of the QPS-Reader and numerical results obtained with qipp A short description of the QPS-Reader and numerical results obtained with qipp Nikolaus Rudak February 12, 2008 The software package qipp is the implentation of an interior point method for the solution

More information

Incomplete Factorization Preconditioners for Least Squares and Linear and Quadratic Programming

Incomplete Factorization Preconditioners for Least Squares and Linear and Quadratic Programming Incomplete Factorization Preconditioners for Least Squares and Linear and Quadratic Programming by Jelena Sirovljevic B.Sc., The University of British Columbia, 2005 A THESIS SUBMITTED IN PARTIAL FULFILMENT

More information

Hot-Starting NLP Solvers

Hot-Starting NLP Solvers Hot-Starting NLP Solvers Andreas Wächter Department of Industrial Engineering and Management Sciences Northwestern University waechter@iems.northwestern.edu 204 Mixed Integer Programming Workshop Ohio

More information

Lecture 13 Stability of LU Factorization; Cholesky Factorization. Songting Luo. Department of Mathematics Iowa State University

Lecture 13 Stability of LU Factorization; Cholesky Factorization. Songting Luo. Department of Mathematics Iowa State University Lecture 13 Stability of LU Factorization; Cholesky Factorization Songting Luo Department of Mathematics Iowa State University MATH 562 Numerical Analysis II ongting Luo ( Department of Mathematics Iowa

More information

Matlab s Krylov Methods Library. For. Large Sparse. Ax = b Problems

Matlab s Krylov Methods Library. For. Large Sparse. Ax = b Problems Matlab s Krylov Methods Library For Large Sparse Ax = b Problems PCG Preconditioned Conjugate Gradients Method. X = PCG(A,B) attempts to solve the system of linear equations A*X=B for X. The N-by-N coefficient

More information

Matrix decompositions

Matrix decompositions Matrix decompositions How can we solve Ax = b? 1 Linear algebra Typical linear system of equations : x 1 x +x = x 1 +x +9x = 0 x 1 +x x = The variables x 1, x, and x only appear as linear terms (no powers

More information

Numerical Linear Algebra

Numerical Linear Algebra Numerical Linear Algebra Direct Methods Philippe B. Laval KSU Fall 2017 Philippe B. Laval (KSU) Linear Systems: Direct Solution Methods Fall 2017 1 / 14 Introduction The solution of linear systems is one

More information

New Results on Energy Balance Analysis of Metabolic Networks

New Results on Energy Balance Analysis of Metabolic Networks New Results on Energy Balance Analysis of Metabolic Networks Qinghua Zhou 1, Simon C.K. Shiu 2,SankarK.Pal 3,andYanLi 1 1 College of Mathematics and Computer Science, Hebei University, Baoding City 071002,

More information

25 : Graphical induced structured input/output models

25 : Graphical induced structured input/output models 10-708: Probabilistic Graphical Models 10-708, Spring 2013 25 : Graphical induced structured input/output models Lecturer: Eric P. Xing Scribes: Meghana Kshirsagar (mkshirsa), Yiwen Chen (yiwenche) 1 Graph

More information

LU Factorization. Marco Chiarandini. DM559 Linear and Integer Programming. Department of Mathematics & Computer Science University of Southern Denmark

LU Factorization. Marco Chiarandini. DM559 Linear and Integer Programming. Department of Mathematics & Computer Science University of Southern Denmark DM559 Linear and Integer Programming LU Factorization Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark [Based on slides by Lieven Vandenberghe, UCLA] Outline

More information

ECEN 615 Methods of Electric Power Systems Analysis Lecture 18: Least Squares, State Estimation

ECEN 615 Methods of Electric Power Systems Analysis Lecture 18: Least Squares, State Estimation ECEN 615 Methods of Electric Power Systems Analysis Lecture 18: Least Squares, State Estimation Prof. om Overbye Dept. of Electrical and Computer Engineering exas A&M University overbye@tamu.edu Announcements

More information

Numerical Linear Algebra

Numerical Linear Algebra Numerical Linear Algebra Decompositions, numerical aspects Gerard Sleijpen and Martin van Gijzen September 27, 2017 1 Delft University of Technology Program Lecture 2 LU-decomposition Basic algorithm Cost

More information

Program Lecture 2. Numerical Linear Algebra. Gaussian elimination (2) Gaussian elimination. Decompositions, numerical aspects

Program Lecture 2. Numerical Linear Algebra. Gaussian elimination (2) Gaussian elimination. Decompositions, numerical aspects Numerical Linear Algebra Decompositions, numerical aspects Program Lecture 2 LU-decomposition Basic algorithm Cost Stability Pivoting Cholesky decomposition Sparse matrices and reorderings Gerard Sleijpen

More information

9. Numerical linear algebra background

9. Numerical linear algebra background Convex Optimization Boyd & Vandenberghe 9. Numerical linear algebra background matrix structure and algorithm complexity solving linear equations with factored matrices LU, Cholesky, LDL T factorization

More information

15. Conic optimization

15. Conic optimization L. Vandenberghe EE236C (Spring 216) 15. Conic optimization conic linear program examples modeling duality 15-1 Generalized (conic) inequalities Conic inequality: a constraint x K where K is a convex cone

More information

Basis Pursuit Denoising and the Dantzig Selector

Basis Pursuit Denoising and the Dantzig Selector BPDN and DS p. 1/16 Basis Pursuit Denoising and the Dantzig Selector West Coast Optimization Meeting University of Washington Seattle, WA, April 28 29, 2007 Michael Friedlander and Michael Saunders Dept

More information

MVE165/MMG631 Linear and integer optimization with applications Lecture 8 Discrete optimization: theory and algorithms

MVE165/MMG631 Linear and integer optimization with applications Lecture 8 Discrete optimization: theory and algorithms MVE165/MMG631 Linear and integer optimization with applications Lecture 8 Discrete optimization: theory and algorithms Ann-Brith Strömberg 2017 04 07 Lecture 8 Linear and integer optimization with applications

More information

Linear Algebra Linear Algebra : Matrix decompositions Monday, February 11th Math 365 Week #4

Linear Algebra Linear Algebra : Matrix decompositions Monday, February 11th Math 365 Week #4 Linear Algebra Linear Algebra : Matrix decompositions Monday, February 11th Math Week # 1 Saturday, February 1, 1 Linear algebra Typical linear system of equations : x 1 x +x = x 1 +x +9x = 0 x 1 +x x

More information

Conceptual Questions for Review

Conceptual Questions for Review Conceptual Questions for Review Chapter 1 1.1 Which vectors are linear combinations of v = (3, 1) and w = (4, 3)? 1.2 Compare the dot product of v = (3, 1) and w = (4, 3) to the product of their lengths.

More information

MATH 2331 Linear Algebra. Section 2.1 Matrix Operations. Definition: A : m n, B : n p. Example: Compute AB, if possible.

MATH 2331 Linear Algebra. Section 2.1 Matrix Operations. Definition: A : m n, B : n p. Example: Compute AB, if possible. MATH 2331 Linear Algebra Section 2.1 Matrix Operations Definition: A : m n, B : n p ( 1 2 p ) ( 1 2 p ) AB = A b b b = Ab Ab Ab Example: Compute AB, if possible. 1 Row-column rule: i-j-th entry of AB:

More information

genetic Minimal Cut Sets - gmcs

genetic Minimal Cut Sets - gmcs genetic Minimal Cut Sets - gmcs Authors: Iñigo Apaolaza, University of Navarra, TECNUN School of Engineering, Spain Luis V. Valcarcel, University of Navarra, TECNUN School of Engineering, Spain Francisco

More information

The convergence of stationary iterations with indefinite splitting

The convergence of stationary iterations with indefinite splitting The convergence of stationary iterations with indefinite splitting Michael C. Ferris Joint work with: Tom Rutherford and Andy Wathen University of Wisconsin, Madison 6th International Conference on Complementarity

More information

Find the solution set of 2x 3y = 5. Answer: We solve for x = (5 + 3y)/2. Hence the solution space consists of all vectors of the form

Find the solution set of 2x 3y = 5. Answer: We solve for x = (5 + 3y)/2. Hence the solution space consists of all vectors of the form Math 2 Homework #7 March 4, 2 7.3.3. Find the solution set of 2x 3y = 5. Answer: We solve for x = (5 + 3y/2. Hence the solution space consists of all vectors of the form ( ( ( ( x (5 + 3y/2 5/2 3/2 x =

More information

Exploiting hyper-sparsity when computing preconditioners for conjugate gradients in interior point methods

Exploiting hyper-sparsity when computing preconditioners for conjugate gradients in interior point methods Exploiting hyper-sparsity when computing preconditioners for conjugate gradients in interior point methods Julian Hall, Ghussoun Al-Jeiroudi and Jacek Gondzio School of Mathematics University of Edinburgh

More information

STAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 13

STAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 13 STAT 309: MATHEMATICAL COMPUTATIONS I FALL 208 LECTURE 3 need for pivoting we saw that under proper circumstances, we can write A LU where 0 0 0 u u 2 u n l 2 0 0 0 u 22 u 2n L l 3 l 32, U 0 0 0 l n l

More information

Numerical Methods I Non-Square and Sparse Linear Systems

Numerical Methods I Non-Square and Sparse Linear Systems Numerical Methods I Non-Square and Sparse Linear Systems Aleksandar Donev Courant Institute, NYU 1 donev@courant.nyu.edu 1 MATH-GA 2011.003 / CSCI-GA 2945.003, Fall 2014 September 25th, 2014 A. Donev (Courant

More information

MATLAB Project: LU Factorization

MATLAB Project: LU Factorization Name Purpose: To practice Lay's LU Factorization Algorithm and see how it is related to MATLAB's lu function. Prerequisite: Section 2.5 MATLAB functions used: *, lu; and ludat and gauss from Laydata4 Toolbox

More information

Solution Set 3, Fall '12

Solution Set 3, Fall '12 Solution Set 3, 86 Fall '2 Do Problem 5 from 32 [ 3 5 Solution (a) A = Only one elimination step is needed to produce the 2 6 echelon form The pivot is the in row, column, and the entry to eliminate is

More information

Pseudoinverse & Moore-Penrose Conditions

Pseudoinverse & Moore-Penrose Conditions ECE 275AB Lecture 7 Fall 2008 V1.0 c K. Kreutz-Delgado, UC San Diego p. 1/1 Lecture 7 ECE 275A Pseudoinverse & Moore-Penrose Conditions ECE 275AB Lecture 7 Fall 2008 V1.0 c K. Kreutz-Delgado, UC San Diego

More information

Journal of Theoretical Biology

Journal of Theoretical Biology Journal of Theoretical Biology 292 (2012) 71 77 Contents lists available at SciVerse ScienceDirect Journal of Theoretical Biology journal homepage: www.elsevier.com/locate/yjtbi A variational principle

More information

Math 242 fall 2008 notes on problem session for week of This is a short overview of problems that we covered.

Math 242 fall 2008 notes on problem session for week of This is a short overview of problems that we covered. Math 242 fall 28 notes on problem session for week of 9-3-8 This is a short overview of problems that we covered.. For each of the following sets ask the following: Does it span R 3? Is it linearly independent?

More information

Part 4: Active-set methods for linearly constrained optimization. Nick Gould (RAL)

Part 4: Active-set methods for linearly constrained optimization. Nick Gould (RAL) Part 4: Active-set methods for linearly constrained optimization Nick Gould RAL fx subject to Ax b Part C course on continuoue optimization LINEARLY CONSTRAINED MINIMIZATION fx subject to Ax { } b where

More information

MODEL ANSWERS TO THE FIRST QUIZ. 1. (18pts) (i) Give the definition of a m n matrix. A m n matrix with entries in a field F is a function

MODEL ANSWERS TO THE FIRST QUIZ. 1. (18pts) (i) Give the definition of a m n matrix. A m n matrix with entries in a field F is a function MODEL ANSWERS TO THE FIRST QUIZ 1. (18pts) (i) Give the definition of a m n matrix. A m n matrix with entries in a field F is a function A: I J F, where I is the set of integers between 1 and m and J is

More information

CS412: Lecture #17. Mridul Aanjaneya. March 19, 2015

CS412: Lecture #17. Mridul Aanjaneya. March 19, 2015 CS: Lecture #7 Mridul Aanjaneya March 9, 5 Solving linear systems of equations Consider a lower triangular matrix L: l l l L = l 3 l 3 l 33 l n l nn A procedure similar to that for upper triangular systems

More information

arxiv: v4 [math.na] 10 Nov 2014

arxiv: v4 [math.na] 10 Nov 2014 NEWTON-BASED OPTIMIZATION FOR KULLBACK-LEIBLER NONNEGATIVE TENSOR FACTORIZATIONS SAMANTHA HANSEN, TODD PLANTENGA, TAMARA G. KOLDA arxiv:134.4964v4 [math.na] 1 Nov 214 Abstract. Tensor factorizations with

More information

MIQR: A MULTILEVEL INCOMPLETE QR PRECONDITIONER FOR LARGE SPARSE LEAST-SQUARES PROBLEMS

MIQR: A MULTILEVEL INCOMPLETE QR PRECONDITIONER FOR LARGE SPARSE LEAST-SQUARES PROBLEMS MIQR: A MULTILEVEL INCOMPLETE QR PRECONDITIONER FOR LARGE SPARSE LEAST-SQUARES PROBLEMS NA LI AND YOUSEF SAAD Abstract. This paper describes a Multilevel Incomplete QR (MIQR) factorization for solving

More information

Math 308 Practice Final Exam Page and vector y =

Math 308 Practice Final Exam Page and vector y = Math 308 Practice Final Exam Page Problem : Solving a linear equation 2 0 2 5 Given matrix A = 3 7 0 0 and vector y = 8. 4 0 0 9 (a) Solve Ax = y (if the equation is consistent) and write the general solution

More information

Projection methods to solve SDP

Projection methods to solve SDP Projection methods to solve SDP Franz Rendl http://www.math.uni-klu.ac.at Alpen-Adria-Universität Klagenfurt Austria F. Rendl, Oberwolfach Seminar, May 2010 p.1/32 Overview Augmented Primal-Dual Method

More information

Sparse and Robust Optimization and Applications

Sparse and Robust Optimization and Applications Sparse and and Statistical Learning Workshop Les Houches, 2013 Robust Laurent El Ghaoui with Mert Pilanci, Anh Pham EECS Dept., UC Berkeley January 7, 2013 1 / 36 Outline Sparse Sparse Sparse Probability

More information

18.06 Problem Set 2 Solution

18.06 Problem Set 2 Solution 18.06 Problem Set 2 Solution Total: 100 points Section 2.5. Problem 24: Use Gauss-Jordan elimination on [U I] to find the upper triangular U 1 : 1 a b 1 0 UU 1 = I 0 1 c x 1 x 2 x 3 = 0 1 0. 0 0 1 0 0

More information

CS60021: Scalable Data Mining. Dimensionality Reduction

CS60021: Scalable Data Mining. Dimensionality Reduction J. Leskovec, A. Rajaraman, J. Ullman: Mining of Massive Datasets, http://www.mmds.org 1 CS60021: Scalable Data Mining Dimensionality Reduction Sourangshu Bhattacharya Assumption: Data lies on or near a

More information

Matrix decompositions

Matrix decompositions Matrix decompositions How can we solve Ax = b? 1 Linear algebra Typical linear system of equations : x 1 x +x = x 1 +x +9x = 0 x 1 +x x = The variables x 1, x, and x only appear as linear terms (no powers

More information

Designs of Orthogonal Filter Banks and Orthogonal Cosine-Modulated Filter Banks

Designs of Orthogonal Filter Banks and Orthogonal Cosine-Modulated Filter Banks 1 / 45 Designs of Orthogonal Filter Banks and Orthogonal Cosine-Modulated Filter Banks Jie Yan Department of Electrical and Computer Engineering University of Victoria April 16, 2010 2 / 45 OUTLINE 1 INTRODUCTION

More information

A direct formulation for sparse PCA using semidefinite programming

A direct formulation for sparse PCA using semidefinite programming A direct formulation for sparse PCA using semidefinite programming A. d Aspremont, L. El Ghaoui, M. Jordan, G. Lanckriet ORFE, Princeton University & EECS, U.C. Berkeley Available online at www.princeton.edu/~aspremon

More information

Computational Methods. Eigenvalues and Singular Values

Computational Methods. Eigenvalues and Singular Values Computational Methods Eigenvalues and Singular Values Manfred Huber 2010 1 Eigenvalues and Singular Values Eigenvalues and singular values describe important aspects of transformations and of data relations

More information

MTH 464: Computational Linear Algebra

MTH 464: Computational Linear Algebra MTH 464: Computational Linear Algebra Lecture Outlines Exam 2 Material Prof. M. Beauregard Department of Mathematics & Statistics Stephen F. Austin State University February 6, 2018 Linear Algebra (MTH

More information

5.5 Quadratic programming

5.5 Quadratic programming 5.5 Quadratic programming Minimize a quadratic function subject to linear constraints: 1 min x t Qx + c t x 2 s.t. a t i x b i i I (P a t i x = b i i E x R n, where Q is an n n matrix, I and E are the

More information

A Quick Tour of Linear Algebra and Optimization for Machine Learning

A Quick Tour of Linear Algebra and Optimization for Machine Learning A Quick Tour of Linear Algebra and Optimization for Machine Learning Masoud Farivar January 8, 2015 1 / 28 Outline of Part I: Review of Basic Linear Algebra Matrices and Vectors Matrix Multiplication Operators

More information

Interior Point Methods. We ll discuss linear programming first, followed by three nonlinear problems. Algorithms for Linear Programming Problems

Interior Point Methods. We ll discuss linear programming first, followed by three nonlinear problems. Algorithms for Linear Programming Problems AMSC 607 / CMSC 764 Advanced Numerical Optimization Fall 2008 UNIT 3: Constrained Optimization PART 4: Introduction to Interior Point Methods Dianne P. O Leary c 2008 Interior Point Methods We ll discuss

More information

AM205: Assignment 2. i=1

AM205: Assignment 2. i=1 AM05: Assignment Question 1 [10 points] (a) [4 points] For p 1, the p-norm for a vector x R n is defined as: ( n ) 1/p x p x i p ( ) i=1 This definition is in fact meaningful for p < 1 as well, although

More information

Algorithm 853: an Efficient Algorithm for Solving Rank-Deficient Least Squares Problems

Algorithm 853: an Efficient Algorithm for Solving Rank-Deficient Least Squares Problems Algorithm 853: an Efficient Algorithm for Solving Rank-Deficient Least Squares Problems LESLIE FOSTER and RAJESH KOMMU San Jose State University Existing routines, such as xgelsy or xgelsd in LAPACK, for

More information

Introduction to PDEs and Numerical Methods Lecture 7. Solving linear systems

Introduction to PDEs and Numerical Methods Lecture 7. Solving linear systems Platzhalter für Bild, Bild auf Titelfolie hinter das Logo einsetzen Introduction to PDEs and Numerical Methods Lecture 7. Solving linear systems Dr. Noemi Friedman, 09.2.205. Reminder: Instationary heat

More information

3. THE SIMPLEX ALGORITHM

3. THE SIMPLEX ALGORITHM Optimization. THE SIMPLEX ALGORITHM DPK Easter Term. Introduction We know that, if a linear programming problem has a finite optimal solution, it has an optimal solution at a basic feasible solution (b.f.s.).

More information

Unravelling the biochemical reaction kinetics from time-series data

Unravelling the biochemical reaction kinetics from time-series data Unravelling the biochemical reaction kinetics from time-series data Santiago Schnell Indiana University School of Informatics and Biocomplexity Institute Email: schnell@indiana.edu WWW: http://www.informatics.indiana.edu/schnell

More information