1. Role: Principal Investigator, Type of Grant: National Science Foundation Faculty Early Career Development (CAREER) Award, Funding Agency: National Science Foundation, Title: CAREER: A Unifying Interior-Point Approach to Sensitivity Analysis and Reoptimization in Conic Programming, Amount: US$400,000, Duration: June 1, 2003 -- May 31, 2008 (terminated in August 2006 due to relocation), Project Number: DMI0237415. (Abstract)
2. Role: Principal Investigator, Type of Grant:  Strategic Partnership for Industrial Resurgence (SPIR), Funding Agency: ADP Investor Communications Services, Title: SPIR - Algorithmic Aspects of Booklet Bundling, Amount: US$18,593, Duration: July 15, 2004 -- July 15, 2005. (Co-PIs: Joseph S. B. Mitchell and Esther M. Arkin)
3. Role: Principal Investigator, Type of Grant: Bilkent University Faculty Research Development Grant, Funding Agency: Bilkent University, Title: Investigations in Geometric Optimization, Amount: US$1,500, Duration: January 1, 2007 -- December 31, 2007.
4. Role: Principal Investigator, Type of Grant:  TUBITAK (Turkish Scientific and Technological Research Council) 1002, Funding Agency: TUBITAK, Title: Development of Specific and Efficient Algorithms for Large-Scale Geometric Optimization Problem, Amount: 20,250 TRY, Duration: October 1, 2007 -- October 1, 2008, Project Number: 107M411.
5. Role: Participant, Type of Grant: Partnership with Industry, Funding Agency: Platform ARGE, Title: Optimization of Spare Parts Depot and Spare Parts Distribution System at TOFAS A.S., Amount: 80,000 TRY, Duration: November 1, 2007 -- August 31, 2008. (PI: Barbaros Tansel, Other Participants: Esra Aybar and Esra Koca)

1. Role: Principal Investigator, Type of Grant:  TUBITAK (Turkish Scientific and Technological Research Council) 1010 EVRENA, Funding Agency: TUBITAK, Title: A Comprehensive Proposal Evaluation and Selection System, Amount: 212,180 TRY, Duration: August 1, 2009 -- February 1, 2012, Project Number: 109M149. (Other Participants: Cevdet Aykanat and Yavuz Oruc)
2. Role: Participant, Type of Grant:  TUBITAK (Turkish Scientific and Technological Research Council) 1001, Funding Agency: TUBITAK, Title: Multi-Objective Optimization Based Solution Methods for Planning and Operational Problems of Wireless Mesh Networks, Amount: 80,100 TRY, Duration: TBA, Project Number: 110M312. (PI: Kağan Gökbayrak)
3. Role: Participant, Type of Grant:  TUBITAK (Turkish Scientific and Technological Research Council) 1001, Funding Agency: TUBITAK, Title: Optimization of Production-Emission and Carbon Allowance Trading Processes Under the Carbon Trade Mechanism and Statistical Analysis of Carbon Market Data, Amount: 153,482 TRY, Duration: TBA, Project Number: 110M307. (PI: Ülkü Gürler, Other Participants: Emre Berk and Deniz Yenigün)

PhD Thesis

• An interior-point perspective on sensitivity analysis in linear programming and semidefinite programming, Ph.D. thesis submitted to Cornell University. (2001) pdf

1. Sensitivity analysis in linear programming and semidefinite programming using interior-point methods, E. Alper Yıldırım and Michael J. Todd. Mathematical Programming, 90 (2) pp. 229-261 (2001). DOI
2. An interior-point approach to sensitivity analysis in degenerate linear programs, E. Alper Yıldırım and Michael J. Todd. SIAM Journal on Optimization, 12 (3) pp. 692-714 (2002). DOI
3. Warm-start strategies in interior-point methods for linear programming, E. Alper Yıldırım and Stephen J. Wright. SIAM Journal on Optimization, 12 (3) pp. 782-810 (2002). DOI
4. An interior-point perspective on sensitivity analysis in semidefinite programming, E. Alper Yıldırım. Mathematics of Operations Research, 28 (4) pp. 649-676 (2003). DOI
5. Approximate minimum enclosing balls in high dimensions using core-sets, Piyush Kumar, Joseph S. B. Mitchell, and E. Alper Yıldırım, The ACM Journal of Experimental Algorithmics, Vol. 8, Article 1 (2003). (Special issue devoted to selected papers from the Fifth Workshop  on Algorithm Engineering and Experiments (ALENEX03))
6. Unifying optimal partition approach to sensitivity analysis in conic optimization, E. Alper Yıldırım. Journal of Optimization Theory and Applications, 122 (2) pp. 405-423 (2004). DOI
7. Minimum volume enclosing ellipsoids and core sets, Piyush Kumar and E. Alper Yıldırım. Journal of Optimization Theory and Applications, 126 (1) pp. 1-21 (2005). DOI Erratum
   
8. On extracting maximum stable sets in perfect graphs using Lovász's theta function, E. Alper Yıldırım and Xiaofei Fan-Orzechowski.  Computational Optimization and Applications, 33 (2-3) pp. 229-247 (2006). DOI
9. On the minimum volume covering ellipsoid of ellipsoids, E. Alper Yıldırım. SIAM Journal on Optimization, 17 (3) pp. 621-641 (2006). DOI (Winner of the 2006 INFORMS Optimization Society Young Researcher Prize)
10. On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids, Michael J. Todd and E. Alper Yıldırım. Discrete and Applied Mathematics, 155 (13) pp. 1731-1744 (2007). DOI
11. Computing minimum volume enclosing axis-aligned ellipsoids, Piyush Kumar and E. Alper Yıldırım. Journal of Optimization Theory and Applications, 136 (2) pp. 211-228 (2008). DOI
12. Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension, Elizabeth John and E. Alper Yıldırım. Computational Optimization and Applications, 41 (2) pp. 151 - 183 (2008). DOI
13. Two algorithms for the minimum enclosing ball problem, E. Alper Yıldırım. SIAM Journal on Optimization, 19 (3) pp. 1368-1391 (2008). DOI
14. Identification and elimination of interior points for the minimum enclosing ball problem, S. Damla Ahipașaoğlu and E. Alper Yıldırım. SIAM Journal on Optimization, 19 (3) pp. 1392-1396 (2008). DOI
15. An algorithm and a core set result for the weighted Euclidean one-center problem, Piyush Kumar and E. Alper Yıldırım.  INFORMS Journal on Computing, 21 (4) pp. 614-629 (2009). DOI
16. A simpler characterization of a spectral lower bound on the clique number, E. Alper Yıldırım. Mathematical Methods of Operations Research, 71 (2) pp. 267-281 (2010). DOI
17. A linearly convergent linear-time first-order algorithm for support vector classification with a core set result , Piyush Kumar and E. Alper Yıldırım. To appear in INFORMS Journal on Computing. (optimization-online)
18. On the accuracy of uniform polyhedral approximations of the copositive cone, E. Alper Yıldırım. To appear in Optimization Methods and Software. (optimization-online)

1. Computing core-sets and approximate smallest enclosing hyperspheres in high dimensions, Piyush Kumar, Joseph S. B. Mitchell, and E. Alper Yıldırım. Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments (ALENEX03), pp. 45 - 55. (2003)

1. An Implementation of Warm-Start Strategies in Interior-Point Methods for Linear Programming, Elizabeth John, Ph.D. in Applied Mathematics and Statistics, Stony Brook University, August 2005.
2. Applications of Lovász's Theta and Lagrangian Functions to Certain Deterministic and Stochastic Optimization Problems, Xiaofei Fan-Orzechowski, Ph.D. in Applied Mathematics and Statistics, Stony Brook University, December 2005. (co-advised with Eugene Feinberg)

1. Design and Implementation of a Proposal Review and Selection System, Esra Koca, Ph.D. in Industrial Engineering, Bilkent University, August 2014 (expected).

1. A Two-Stage Solution Approach to Spare Parts Distribution under a Special Cost Structure, Esra Koca, M.S. in Industrial Engineering, Bilkent University, July 2010.
2. Implementation of a Specialized Algorithm for Clustering Using Minimum Enclosing Balls, Utku Gurușçu, M.S. in Industrial Engineering, Bilkent University, July 2010.
3. Row Generation Techniques for Approximate Solution of Linear Programming Problems, Burak Paç, M.S. in Industrial Engineering, Bilkent University, September 2010.

1. First-Order Methods in Convex Optimization (tentative title), Selva Şelfun, M.S. in Industrial Engineering, Bilkent University, Summer 2011 (expected).

• Minimum Enclosing Ball: A MATLAB code that computes the minimum enclosing ball of a given set of points. The code starts by picking two points and iteratively adds one point at a time until the desired accuracy is achieved. Each subproblem is solved by the SOCP solver of SDPT3. The code can solve instances of the problem with up to 100,000 points in 1,000 dimensions on a moderate personal computer. Joint work with Piyush Kumar and Joseph Mitchell.
• Maximum Stable Sets in Perfect Graphs: A MATLAB code that extracts a maximum stable set in a perfect graph using Lovász's theta function on successively smaller graphs. Joint work with Xiaofei Fan-Orzechowski. Available upon request.
• Warm-Start Strategies in Interior-Point Methods for Linear Programming: A modification of the interior-point solver PCx that implements warm-start strategies in interior-point methods in linear programming in fixed dimension. Joint with Elizabeth John. Available upon request.
  

• Optimization Online. A repository of papers in optimization.
• Mathematical Programming Society
• Semidefinite programming home page (maintained by Cristoph Helmberg).
• SIAM. Society of Industrial and Applied Mathematics.
• SIAM Activity Group on Optimization
• INFORMS. Institute for Operations Research and Management Science.
• School of Operations Research and Information Engineering, Cornell University.