- Copyright information to be inserted by the Publishers Solving LargeScale Linear Programs
- Computational Experience with Lenstra's Algorithm # Liyan Gao + Yin Zhang #
- On Convergence of Minimization Methods: Attraction, Repulsion and Selection 1
- A General Robust-Optimization Formulation for Nonlinear Programming
- Samuel Burer 1 \Delta Renato D.C. Monteiro 2 \Delta Yin Zhang 3 Solving a Class of Semidefinite Programs
- An Alternating Direction Algorithm for Nonnegative Matrix Factorization
- Simultaneous Structure Factor and Contrast Transfer Function Parameter Determination in
- Interior-Point Methods and Semidefinite Programming
- CS Theory Algorithms Conclusion Compressive Sensing Theory and
- CAAM 454/554: Afternotes on Krylov-Subspace Iterative Methods
- Lecture Notes for CAAM 378 A Quick Introduction to Linear Programming
- Iterative Methods Linear Systems
- !"$#"%'&)()02103%4&)56 798A@BDCE8EFHGPIRQTSUCWVEXEQTSYB`FbacQedF2fIgQTSihEFPIp@XEQbqrQeIe8sVHtuBravV2SwGASxQyCeVhEt@I@VhA@hsbFf@hEQyFASBsBIgQTq798EQWBgQqrQeIe8sVHtuBDFASxQBWA@IgF22fQDdr8EQThIW8EQt2QWBp@SxQytTVuF2f@BrIRVqrFPu@dq`@eyQGEFASxF2ffQTf@BWqf798EQ
- CAAM 454/554: Numerical Analysis II (Spring 2010) Instructor: Yin Zhang, Room: DH 3090, Phone: X5744.
- Numerical Analysis Part II (CAAM 554) Qualifying Exam Preparation List (2011)
- A UNIFIED APPROACH TO MATHEMATICAL OPTIMIZATION AND LAGRANGE MULTIPLIER THEORY FOR SCIENTISTS AND ENGINEERS
- )01 $" 3245$#67)' 8@9BADCEA@FGCEAHFPIRQRSUTGADCWVDX7Y`AbaD9RIGcd7QBAfegXhViC7afVWIqpBADCrYscrIutPFPIuVvIqwxeyRSSAYCcacrIBAbFGCieyuew
- Iterative Methods for Optimization C.T. Kelley
- Lecture Notes for CAAM 378 A Quick Introduction to Linear Programming
- CAAM Technical Report TR07-10 A Fast Algorithm for Image Deblurring
- Fluence Map Optimization in IMRT Cancer Treatment Planning and A Geometric Approach
- Optimization Methods and Software, Vol.11&12, pp.385-396, 1999 User's Guide to LIPSOL
- Testing Unconstrained Optimization JORGE J. MORI~,BURTON S. GARBOW, and KENNETH E. HILLSTROM
- Solution Sketches for CAAM 554: Mid-Term Exam (Spring 2011) Assume that A, Q Rmm are nonsingular, and b Rm. Let Kn(A, b) be the n-th Krylov
- CAAM 554: Exam 2 (Spring 2011) Due: 6:00pm April 22, Friday. Accepted until 6pm, April 25, Monday
- Solution Sketches for CAAM 454: Mid-Term Exam (Spring 2011) Assume that A, M Rmm, b, c Rm and A is nonsingular. For W 0, the weighted 2-norm
- CAAM 335 Matrix Analysis Matlab Project on Least Squares and More
- CAAM 454/554 Handout: Sparse Cholesky Cholesky decomposition is the most efficient direct method to solve linear systems with
- CAAM Assignment: primal-dual interior-point method Assignment
- CAAM Handout: Sparse Cholesky Cholesky decomposition is the most efficient way to solve linear systems with symmetric,
- Solving Semidefinite Programs via Nonlinear Programming Part I: Transformations and Derivatives \Lambda
- A Compressive Sensing and Unmixing Scheme for Hyperspectral Data Processing
- On Numerical Solution of the Maximum Volume Ellipsoid Problem \Lambda
- RANKTWO RELAXATION HEURISTICS FOR MAXCUT AND OTHER BINARY QUADRATIC PROGRAMS \Lambda
- InteriorPoint Gradient Methods with DiagonalScalings for SimpleBound Constrained Optimization
- Maximum Stable Set Formulations and Heuristics Based on Continuous Optimization \Lambda
- CAAM Assignment: primal-dual interior-point method Assignment
- The Effect of the Separation of Variables on the Molecular Replacement Method
- THEORY OF COMPRESSIVE SENSING VIA 1-MINIMIZATION: A NON-RIP ANALYSIS AND EXTENSIONS
- InteriorPoint Algorithms for Semidefinite Programming Based on a Nonlinear Formulation \Lambda
- Selective Search for Global Optimization of Zero or Small Residual LeastSquares Problems: A Numerical Study
- An interiorpoint gradient method for largescale totally nonnegative least squares problems #
- A Global Optimization Method for the Molecular Replacement Problem in X-ray Crystallography
- The Bayesian Statistical Approach to the Phase Problem in Protein Xray
- User's Guide for YALL1: Your ALgorithms for L1 Optimization
- Solution-recovery in 1-norm for non-square linear systems: deterministic conditions and open questions
- User's Guide for LMaFit: Low-rank Matrix Fitting Department of CAAM
- Solving Semidefinite Programs via Nonlinear Programming Part II: Interior Point Methods for a Subclass of SDPs \Lambda
- A Computational Study of a GradientBased LogBarrier Algorithm for a Class of LargeScale SDPs \Lambday
- Properties of a class of preconditioners for weighted least squares problems \Lambda
- CAAM 335: Matrix Analysis (Fall, 2009) Instructor: Yin Zhang, Room: DH 3090, Phone: X5744.
- CAAM 454/554: Exam One Solutions (Spring 2010) 1. Prove that the Jacobi method for Ax = b is convergent if A is column strictly diagonally
- CAAM 454/554: Exam 2 (Spring 10) 1. (10 points) Let X Rn
- Solving the Double Digestion Problem as a MixedInteger Linear Program \Lambda
- A Fast Newton's Algorithm for Entropy Maximization in Phase Determination \Lambda
- Case studies for a first-order robust nonlinear programming formulation
- Convergence of a Class of Stationary Iterative Methods for Saddle Point Problems
- CAAM 454/554: Stationary Iterative Methods Yin Zhang (draft)
- SMV --An ObjectOriented Sparse MatrixVector Computation Library
- An InteriorPoint Algorithm for the MaximumVolume Ellipsoid Problem \Lambda
- The Sphere of Convergence of Newton's Method on Two Equivalent Systems from Nonlinear Programming
- Detailed Data for Test Problem Sets 1 and 2 The rst three columns of the tables give problem number and size where m is the number
- Dose-volume-based IMRT fluence optimization: A fast least-squares approach with differentiability
- Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization
- Local Behavior of the Newton Method on Two Equivalent Systems from Linear Programming 1 2
- CAAM 454/554 Project: Output Least Squares for an Inverse Problem
- "!#" %$& ' ( )10324 57698A@CBEDGFAHFI8%BQPRFSHT98VUA8WFW6RX`YaDcbRDd8eYgfhXBiDIXqpTrHtsRuvpPrBQur8VpHws98ePrBCDGxRDGFI8%UyD89Bh8g9PRDd8eY
- ALTERNATING DIRECTION ALGORITHMS FOR 1-PROBLEMS IN COMPRESSIVE SENSING
- CAAM 564: Numerical Optimization (Spring, 2009) Instructor: Yin Zhang, Room: DH 3090, Phone: X5744.
- A Successive Linear Programming Approach to IMRT Optimization Problem
- RANK-TWO RELAXATION HEURISTICS FOR MAX-CUT AND OTHER BINARY QUADRATIC PROGRAMS
- CAAM Assignment: primal-dual interior-point method Assignment
- Infeasible Primal-Dual (Path-Following)
- A NONMONOTONE LINE SEARCH TECHNIQUE AND ITS APPLICATION TO UNCONSTRAINED OPTIMIZATION
- CAAM Handout: Sparse Cholesky Cholesky decomposition is the most efficient way to solve linear systems with symmetric,
- CAAM 564 Project 1 Instructor: Yin Zhang