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

Similar documents
A convex QP solver based on block-lu updates

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

A review of sparsity vs stability in LU updates

Implementation of a KKT-based active-set QP solver

LUSOL: A basis package for constrained optimization

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

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

Ax=b. Zack 10/4/2013

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

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

Computationally efficient flux variability analysis

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

Sparse Rank-Revealing LU Factorization

Sparse Rank-Revealing LU Factorization

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

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

V15 Flux Balance Analysis Extreme Pathways

Introduction to Mathematical Programming

Revised Simplex Method

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

Nonlinear Optimization for Optimal Control

Variational Bayesian Inference Techniques

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

A REGULARIZED ACTIVE-SET METHOD FOR SPARSE CONVEX QUADRATIC PROGRAMMING

Large-scale Linear and Nonlinear Optimization in Quad Precision

Convex Quadratic Approximation

Generalized MINRES or Generalized LSQR?

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

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

9. Numerical linear algebra background

Roundoff Error. Monday, August 29, 11

Stoichiometric vector and matrix

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

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

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

Finding a point in the relative interior of a polyhedron

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

On Optimal Frame Conditioners

Scientific Computing

1.Chapter Objectives

Linear Programming: Simplex

Chapter 8 Structured Low Rank Approximation

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

1 Computing with constraints

Optimization Algorithms for Compressed Sensing

Lecture: Algorithms for LP, SOCP and SDP

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

Incomplete Factorization Preconditioners for Least Squares and Linear and Quadratic Programming

Hot-Starting NLP Solvers

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

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

Matrix decompositions

Numerical Linear Algebra

New Results on Energy Balance Analysis of Metabolic Networks

25 : Graphical induced structured input/output models

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

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

Numerical Linear Algebra

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

9. Numerical linear algebra background

15. Conic optimization

Basis Pursuit Denoising and the Dantzig Selector

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

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

Conceptual Questions for Review

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

genetic Minimal Cut Sets - gmcs

The convergence of stationary iterations with indefinite splitting

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

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

STAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 13

Numerical Methods I Non-Square and Sparse Linear Systems

MATLAB Project: LU Factorization

Solution Set 3, Fall '12

Pseudoinverse & Moore-Penrose Conditions

Journal of Theoretical Biology

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

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

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

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

arxiv: v4 [math.na] 10 Nov 2014

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

Math 308 Practice Final Exam Page and vector y =

Projection methods to solve SDP

Sparse and Robust Optimization and Applications

18.06 Problem Set 2 Solution

CS60021: Scalable Data Mining. Dimensionality Reduction

Matrix decompositions

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

A direct formulation for sparse PCA using semidefinite programming

Computational Methods. Eigenvalues and Singular Values

MTH 464: Computational Linear Algebra

5.5 Quadratic programming

A Quick Tour of Linear Algebra and Optimization for Machine Learning

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

AM205: Assignment 2. i=1

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

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

3. THE SIMPLEX ALGORITHM

Unravelling the biochemical reaction kinetics from time-series data

Transcription:

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

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

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

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

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

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

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

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

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

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 1 10 6 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

Example data Flux Balance Analysis LP problem Ax = b Organism Problem Dimensions T. maritima ME_2011 18000 17600 E. coli ME_2009 21000 25000 E. coli ME_2010 68000 77000 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

Experimental results LP problem CPLEX simplex solver original with rebuild Problem b Ax 1 Time b Ax 1 Time TM 2011 2.6 10 8 0.9 4.6 10 9 1.2 EC 2009 4.6 10 7 1.1 1.7 10 7 2.1 EC 2010 1.3 10 4 242.8 2.9 10 6 292.3 Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 9/19

Experimental results LP problem CPLEX simplex solver original with rebuild Problem b Ax 1 Time b Ax 1 Time TM 2011 2.6 10 8 0.9 4.6 10 9 1.2 EC 2009 4.6 10 7 1.1 1.7 10 7 2.1 EC 2010 1.3 10 4 242.8 2.9 10 6 292.3 CPLEX barrier solver original with rebuild Problem b Ax 1 Time b Ax 1 Time TM 2011 7.9 10 9 7.9 3.15 10 9 9.8 EC 2009 3.0 10 5 32.0 4.75 10 6 14.0 EC 2010 1.4 10 1 384.0 3.42 10 6 93.3 Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 9/19

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

LUSOL Other solvers Stoichiometric matrix (rank-decient) 2 S = 6 4 5 0 10 0 5 0 0 3 0 6 6 0 10 0 21 1 10 1 0 6 1 13 12 1 3 7 5 Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 17/19

LUSOL Other solvers Stoichiometric matrix (rank-decient) 2 S = 6 4 5 0 10 0 5 0 0 3 0 6 6 0 10 0 21 1 10 1 0 6 1 13 12 1 3 7 5 SVD 2 29.5 S = UDV T U, V orthogonal D = 6 4 18.8 0.88 3 7 5 ɛ 1 Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 17/19

LUSOL Other solvers Stoichiometric matrix (rank-decient) 2 S = 6 4 5 0 10 0 5 0 0 3 0 6 6 0 10 0 21 1 10 1 0 6 1 13 12 1 3 7 5 SVD 2 29.5 S = UDV T U, V orthogonal D = 6 4 18.8 0.88 3 7 5 ɛ 1 LUSOL with threshold rook pivoting Ltol= 2.0 2 32 1 5 S = LDU = 6 1 76 4 2 1 54 2 1 1 3 1 ɛ 2 32 3 1 2 1 76 1 2 2 7 54 1 1 15 x x x Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 17/19

LUSOL Other solvers LUSOL with rook pivoting and reducing Ltol Sorted elements of D: SVD 29.5 18.8 0.9 ɛ Ltol 2.0 5.0 3.0 1.0 ɛ 1.5 21.0-13.0 0.2 ɛ 1.1 21.0-13.0 0.2 ɛ Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 18/19

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

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

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

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

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

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 http://www.stanford.edu/group/sol/software.html Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 19/19

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 http://www.stanford.edu/group/sol/software.html and more (COBRA Toolbox and extensions) Stanford/UCSD/Iceland Satisfying Flux Balance and Mass-Action Kinetics 19/19