- Dynamic Spectrum Management with the Competitive Market Model
- Online Algorithms 1 Introduction : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : Online1
- Computational Optimization Laboratory Positive Semide nite Programming
- New Results on Quadratic Minimization Yinyu Ye y Shuzhong Zhang z
- Research Assistantships for Doctoral Study in Optimization
- A Lower Bound on the Number of Iterations of LongStep PrimalDual Linear Programming
- SOLNP USERS' GUIDE ---A Nonlinear Optimization Program in MATLAB
- 18.415/6.854 Advanced Algorithms November 1994 Network flows
- InteriorPoint Algorithm: Theory and Analysis To my family and parents
- A computational study of the homogeneous algorithm for largescale convex optimization
- 18.415/6.854 Advanced Algorithms October 1994 Linear Programming
- Condition Numbers for Polyhedra with Real Number Data
- Constrained Logarithmic Least Squares in Parameter Estimation 1
- Semide nite Relaxations, Multivariate Normal Distributions, and Order Statistics
- Solutions to the EndofChapter Excercises in ``InteriorPoint Algorithm: Theory and
- ON SOLVING FEWNOMIALS OVER INTERVALS IN FEWNOMIAL J. MAURICE ROJAS # AND YINYU YE +
- Mixed Linear and Semide nite Programming for Combinatorial and Quadratic Optimization
- Probabilistic analysis of two complexity measures for linear programming problems \Lambda
- Approximating quadratic programming with bound and quadratic constraints
- Solving Sparse Semide nite Programs Using the Dual Scaling Algorithm with an Iterative Solver
- A Superlinearly Convergent O( nL)Iteration
- 2006 Cambridge Dr. Coralville, Iowa 52241
- A Note on Quadratic Convergence of the Homogeneous and SelfDual Linear Programming Algorithm
- Mathematical Programming A Publication of the
- Mathematical Programming manuscript No. (will be inserted by the editor)
- Complexity Analysis of the Analytic Center Cutting Plane Method That Uses Multiple Cuts 1
- SYLLABUS FOR 6K:176 Managerial Decision Models
- InteriorPoint Algorithms: First Year Progress Report on NSF Grant
- A BuildUp InteriorPoint Method for Linear Programming: Affine Scaling Form
- Bounded Error Parameter Estimation: A Sequential Analytic Center Approach
- InteriorPoint Algorithms: Final Project Report NSF Grant DDM8922636
- Improved Approximations for Max Set Splitting and Max NAE SAT
- The Simplex Method is Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate
- Semidefinite Programming Rank Reduction for Graph Realization and Sensor Network
- A Dynamic Near-Optimal Algorithm for Online Linear Programming Shipra Agrawal
- 18.415/6.854 Advanced Algorithms September 1994 Randomized Algorithms
- A .699-Approximation Algorithm for Max-Bisection
- A 1:52-Approximation Algorithm for the Uncapacitated Facility Location Problem
- On a Homogeneous Algorithm for a Monotone Complementarity Problem with Nonlinear Equality Constraints
- Approximation algorithms for quadratic programming \Lambda Department of Electrical and Computer Engineering,
- An Improved Rounding Method and Semide nite Programming Relaxation for
- Optimality principles in nonequilibrium biochemical networks R. M. T. Fleming
- Combining interiorpoint and pivoting algorithms for linear programming
- Semide nite Programming and Approximation Algorithms: Second-Year Project Report
- On a Homogeneous Algorithm for the Monotone Complementarity Erling D. Andersen \Lambda
- On Homogeneous and SelfDual Algorithms for LCP \Lambda July 1994 (revised August 1995)
- Semide nite Programming and Approximation Algorithms: First-Year Project Report
- Blind Channel Equalization and -Approximation Algorithms
- On the Budgeted MAXCUT problem and its Application to the Capacitated TwoParallel Machine Scheduling \Lambda
- InteriorPoint Algorithms: First Year Progress Report on NSF Grant DDM8922636
- An Efficient Algorithm for Minimizing a Sum of PNorms Guoliang Xue \Lambda Yinyu Ye y
- An Improved Rounding Method and Semidefinite Programming Relaxation for
- Further Development on the Interior Algorithm for Convex Quadratic Programming
- InteriorPoint Algorithms: 1996 Annual Progress Report on NSF Grant DMI9522507
- InteriorPoint Algorithms: 1994 Annual Progress Report on NSF Grant DDM9207347
- INFEASIBLESTART PRIMALDUAL METHODS AND INFEASIBILITY DETECTORS
- Improved Analyses of Facility Location Algorithms Jiawei Zhang and Yinyu Ye
- Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems 1
- Approximation of Dense-n -Subgraph and
- A Simplified Homogeneous and SelfDual Linear Programming Algorithm and Its Implementation \Lambda
- On Approximation of Max-Vertex-Cover Qiaoming Han y
- .586 Approximation of Dense-n -Subgraph
- Solving LargeScale Sparse Semidefinite Programs for Combinatorial Optimization \Lambda
- The Simplex and Policy-Iteration Methods are Strongly Polynomial for the Markov Decision Problem with a
- 545 Technology Square; Cambridge, Massachusetts 02139 (617) 2535851 Massachusetts
- Application of Semide nite Programming to Circuit Partitioning
- A PrimalDual Interior Point Method Whose Running Time Depends Only on the Constraint
- OPERATIONS RESEARCH Vol. 00, No. 0, Xxxxx 0000, pp. 000000
- A simplification to ``A PrimalDual Interior Point Method Whose Running Time Depends
- An Approximation Algorithm for the Two-Parallel Machines Scheduling
- Introduction to Semidefinite Programming SDP Solution Rank Theorems
- A Dynamic Near-Optimal Algorithm for Online Linear Programming Shipra Agrawal
- Approximation of Dense-n -Subgraph and
- Line Search in Potential Reduction Algorithms for Linear Programming
- Probabilistic Analysis of an InfeasibleInteriorPoint Algorithm for Linear Programming
- Convergence Results of the Analytic Center Estimator
- Yinyu Ye received the B.S. degree in System Engineering from the Huazhong University of Science and Technology, Wuhan, China,
- Competitive Communication Spectrum Economy and Equilibrium October 22, 2007; revised January 25, 2010
- NP-Hardness Results Related to Chuangyin Dang
- Mathematical Programming manuscript No. (will be inserted by the editor)
- Fast and NearOptimal Matrix Completion via Randomized Basis Pursuit
- An interior-point path-following algorithm for computing a Leontief
- Newsvendor Optimization with Limited Distribution Information
- Further Relaxations of the SDP Approach to Sensor Network Localization
- InteriorPoint Algorithm: Theory and Analysis June 1996, Revised January 1997
- The Fixed-Hub Single Allocation Problem: A Geometric Rounding Approach Dongdong Ge
- OPERATIONS RESEARCH Vol. 00, No. 0, Xxxxx 0000, pp. 000000
- Computational Market Equilibrium Yinyu Ye, WINE2008 1 Computational Economy Equilibrium and its Application
- 16 Stowe Lane, Menlo Park, CA 94025 Home (650) 233-8988 and Office (650) 723-7262
- Identifying an optimal basis in linear programming
- An Asymptotical O( nL)Iteration PathFollowing Linear
- An Infeasible InteriorPoint Algorithm for Solving Primal and Dual Geometric Programs \Lambda
- A Dynamic Near-Optimal Algorithm for Online Linear Programming
- A Generalized Homogeneous and SelfDual Algorithm for Linear Programming
- On the von Neumann Economic Growth Problem Yinyu YE \Lambda
- Yinyu Ye: DMI9522507 9 3.4 Progress in implementation and application
- nL)Iteration Combined Phase IPhase II Potential Reduction Algorithm for Linear Programming
- DSDP3: Dual Scaling Algorithm for General Positive Semide nite Programming
- Approximation algorithms for quadratic programming \Lambda Department of Electrical and Computer Engineering,
- 18.415/6.854 Advanced Algorithms November 1994 Approximation Algorithms
- Interior Point Methods for Nonlinear Complementarity Florian A. Potra \Lambda
- Semidefinite Relaxations, Multivariate Normal Distributions, and Order Statistics
- On Equilibrium Pricing as Convex Optimization Jiawei Zhang
- On HomotopySmoothing Methods for Variational Inequalities
- InteriorPoint Algorithms: 1997 Annual Progress Report on NSF Grant DMI9522507
- Progress in Linear Programming: InteriorPoint Algorithms Yinyu YE \Lambda ,
- Approximate Farkas Lemmas and Stopping Rules for Iterative InfeasiblePoint Algorithms for
- On Solving the P 0 Matrix Linear Complementarity Xiaojun Chen \Lambda
- InteriorPoint Algorithms: Final Project Report NSF Grant DDM9207347
- Approximating global quadratic optimization with convex quadratic constraints
- Convergence behavior of central paths for convex homogeneous selfdual cones This is a preliminary discussion note resulted among Nesterov, Todd and myself. I hope it would be
- Universal Rigidity: Towards Accurate and Efficient Localization of Wireless Networks
- The Simplex and Policy-Iteration Methods are Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate
- Dear Tim's Parents, Friends and Family, I am honored to have you all here with me at our daughter, Fei's wedding, a milestone in
- Mathematical Programming Computation manuscript No. (will be inserted by the editor)
- Computational Models and Complexities of Tarski's Fixed Points
- file:///C|/Users/Yinyu%20Ye/Documents/MATLAB/work/DSDP5.8/README.txt[12/29/2011 4:09:18 PM] The ".dll" file extension for MEX-files is no longer supported in the latest versions of MATLAB (ex: R2008b). So we
