Colloquium, Workshop, Tutorial and Plenary-Session Speaker

1. Compressive Sensing Theory and L1-related Optimization Algorithms. Department of Computational and Applied Mathematics, Rice University. January 26, 2009.

2. Acquiring less data without losing content: Compressive Sensing Theory and Algorithms. The First International Conference on Frontiers in Computational Mathematics. Invited Speaker. Guilin, China, December 15-17, 2008.

3. Compressive Sensing Theory and Algorithms. Institute of Electronics, Chinese Academy of Sciences. December 5, 2008.

4. A class of fast algorithms for TV-based Image Reconstruction. Institute of Computational Mathematics and Scientific/Engineering Computing, Chinese Academy of Sciences. December 4, 2008.

5. Acquiring Less Data Without Losing Content: Compressive Sensing Theory and Algorithms. Invited speaker. DTRA-NSF 2008 Algorithm Workshop. Baltimore, Maryland, November 4-6,2008.

6. Enhanced Compressive Sensing and More. Invited one-hour talk Speaker, Workshop on Nonlinear Approximation Techniques Using L1, Texas A & M University, May 16th, 2008.

7. Large-Scale L1-Related Minimization in Compressive Sensing and Beyond. Colloquium, Department Mathematics, Arizona State University. March 5th, 2008.

8. A Fixed-Point Continuation Method for $\ell_1$-Regularized Minimization with Application to Compressed Sensing (with Elaine Hale and Wotao Yin). 2007 von Neumann Symposium on Sparse Representation and High-Dimensional Geometry. Snowbird Utah July 8-12, 2007.

9. Solution Recovery via L1 minimization: What are possible and Why? Eighth US-Mexico Workshop on Optimization and its Applications Huatulco, Mexico, January 8 - 12, 2007.

10. An approach to optimal cancer radiation treatment planning. Invited talk at the Annual Meeting of the Chongqing Society of Industrial and Applied Mathematics. June 17th, 2006.

11. Hilbert's 17th problem, EDP and conic programming. Collage of Mathematics and Sciences, Chongqing University. June 14th, 2006.

12. Hilbert's 17th problem, SDP and conic programming. Department of Mathematics, Chongqing Normal University. June 12th, 2006.

13. Solution recovery for non-square systems via L1 minimization. Invited Lecture at the International Conference on Nonlinear Programming with Applications, Shanghai, China. May 29th, 2006.

14. Sparse solution recovery by L1-minimization. Special Session on New Developments in Optimization. 2006 Spring Central Sectional Meeting, Notre Dame, IN, April 8-9, 2006.

15. A General Robust-optimization Framework for Nonlinear Optimization. Workshop On Large-Scale Robust Optimization. Santa Fe, New Mexico, August 31 - September 2, 2005.

16. A Robust optimization formulation for general nonlinear programming. Department of Information Systems and Algorithms, Delft University of Technology. Delft, Netherlands. May 12, 2005.

17. Optimization in Action: Help treating cancers. Distinguished Lecture Series. Dept of Industrial Engineering, University of Houston. March 11, 2005.

18. Optimization in Action: Help treating cancers. Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong. Nov. 17, 2004.

19. Optimization in Action: Help treating cancers. Department of Applied Mathematics, Hong Kong Polytechnic University. Oct. 21, 2004.

20. A Unified Analysis for a Class of Long-Step Primal-Dual Path-Following Interior-Point Algorithms for Semidefinite Programming (with Monteiro). ICS Prize Tutorial. INFORMS Annual Meeting 2002, San Jose, Nov. 17-20, 2002.

21. A Global Optimization Problem in Computational Biology: Molecular Replacement Problem. Thematic Year Optimization Visitors to the Fields Institute, May 13, 2002.

22. Hilbert's 17th Problem, SDP and DSP and Some New Applications of SDP. Colloquium, Department of Computational and Applied Mathematics, Rice University. Feb. 11, 2002.

23. Interior point methods for mathematical programming. Invited 1.5-hour Tutorial. INFORMS Annual Meeting, Miami Beach, Florida, November 3-7, 2001.

24. Interior point methods and semidefinite programming. Scientific Computing Seminar, University of Houston. Feb. 15, 2001. Houston, Texas.

25. Interior point methods and semidefinite programming. 2000 SIAM Annual Meeting. Invited Plenary speaker. July 10-14, 2000. Rio Grande, Puerto Rico.

26. Solving Semidefinite Programs via Nonlinear Programming. Department of Mathematics, University of California Los Angeles, November 9, 1999.

27. Solving Semidefinite Programs via Nonlinear Programming: Transformations and Derivatives. First Workshop on Nonlinear Optimization: "Interior-Point and Filter Methods". Center for Mathematics - University of Coimbra, Portugal. October 27-30, 1999.

28. Solving Semidefinite Programs via Nonlinear Programming. Invited plenary lecture, Nanjing International Conference on Optimization and Numerical Linear Algebra. Nanjing, China. Sept. 27-30, 1999.

29. Solving Semidefinite Programs via Nonlinear Programming. Part I: Transformations and Derivatives. Department of Computational and Applied Mathematics, Rice University, Sept. 13, 1999.

30. An Interior-Point Algorithm for the Max-Volume Ellipsoid Problem. DIMACS Workshop on Semidefinite Programming and its Applications to Large Scale Discrete Optimization. Princeton University. January 7-9, 1999.

31. A Unified Analysis for a Class of Primal-Dual Path-Following Algorithms for Semidefinite Programming. Invited Lecture at the International Symposium on Computation and Optimization, Hayama, Kanagawa, Japan, Aug. 12-16, 1996.

32. Infeasible Primal-Dual Interior-Point Methods for Semidefinite Programming. Workshop on Semidefinite Programming and Interior-Point Approaches for Combinatorial Optimization Problems. The Fields Institute, Toronto, Canada. May 15-17, 1996.

33. Infeasible interior point methods: theory and software. Courant Institute of Mathematics, New York University, Nov. 17, 1995.

34. Infeasible interior point methods: theory and software. Invited speaker at the DOE/OSC Mathematics Workshop, Albuquerque, NM. Feb. 29 - Mar. 1, 1995.

35. Interior-point methods for linear programming: the state of the art (as an invited plenary speaker). The 1993 Conference on Scientific and Engineering Computing for Young Chinese Scientists, Beijing, China, Aug. 16-21, 1993.

36. Convergence of infeasible interior-point methods for the horizontal linear complementarity problem. Center for Applied Mathematics, Cornell University, April 30, 1993.

37. Interior point methods for linear and nonlinear programming. Department of Mathematical Sciences, Johns Hopkins University, October, 1992.

38. Interior point algorithms for linear programming, Mathematics and Statistics Colloquium, American University, March 26, 1991.

39. Convergence of primal-dual interior-point algorithms for linear programming, Numerical Analysis Seminar, Department of Mathematics, University of Maryland College Park, Dec. 6, 1990.