CS675: Convex and Combinatorial Optimization (Spring 2018)
- Lecture time: Wednesday 2:00pm - 5:20pm
- Lecture place: KAP 159
- Instructor: Shaddin Dughmi
- Email: firstname.lastname@example.org
- Office: SAL 234
- Office Hours: Thursday 10:30am-11:30am or by appointment
- TA: Ho Yee Cheung
- Email: email@example.com
- Office Hours: Tuesday 3-5pm in SAL 246
- Course Homepage: www-bcf.usc.edu/~shaddin/cs675sp18
- May 7: Homework 4 solutions are out.
- April 16: Homework 4 will now be due on April 25.
- April 6: Homework 3 solutions are out.
- April 4: Homework 4 is out. It will be due on Wednesday April 18. Please read the instructions carefully, and start early.
- Mar 8: Homework 3 is out. It will be due on Wednesday March 28. Please read the instructions carefully, and start early.
- Mar 7: Homework 2 solutions are out.
- Feb 28: Project proposals are now due by midnight on Sunday March 11.
- Feb 17: Homework 1 solutions are out.
- Feb 8: Homework 2 is out. It will be due on Wednesday Feb 28. Please read the instructions carefully, and start early.
- Feb 8: Project instructions have been posted. The proposal is due on Wednesday March 7, and the final report is due on Monday May 7.
- Jan 20: Homework 1 is out. It will be due on Wednesday Feb 7. Please read the instructions carefully, and start early.
- Jan 11: Class mailing list has been created. I have invited everybody who is officially registered in the class to the mailing list. But for those of you waiting to register, in the meantime you can manually join the google group csci675-sp18-usc.
- Jan 11: The class is currently full, but like I mentioned I am doing everything I can to accomodate everybody. While I can't make any promises, my experience is that things will likely clear up and you will be able to take the class if you really want to.
- Jan 11: Course website is up!
Schedule by Week
- Week 1: Introduction to Optimization. Linear Programming and Duality.
- Week 2: Convex Sets.
- Week 3: Convex Functions. Geometric Duality
- Week 4: Convex optimization Problems
- Week 5: Duality of Convex Optimization Problems. KKT conditions.
- Weeks 6-7: Combinatorial problems as linear and convex programs
- Weeks 8-9: Algorithms: Simplex method, ellipsoid method and its consequences.
- Slides: Simplex, Ellipsoid, Consequences of Ellipsoid.
- Reading: Korte Vygen Chapter 3 (Simplex Algorithm) and Chapter 4 (Ellipsoid Algorithm).
- Additional Reading: Luenberger and Ye Chapter 3 and Vince Conitzer's lecture notes for an algebraic treatment of the simplex method
- Highly recommended: Ryan O'Donnell's lecture notes on the Ellipsoid method: here and here.
- Highly recommended: For equivalence of separation and optimization, I recommend the impeccably-written breakthrough paper by Grotschel, Lovasz and Schrijver. You may have to use the USC library proxy to get access, or find it elsewhere online.
- Highly recommended: For a more thorough treatment of all topics related to the Ellipsoid method and its consequences, check out the book Geometric Algorithms and Combinatorial Optimization by Grotschel, Lovasz, and Schrijver. Available electronically for free through USC libraries.
- Week 10: Matroid theory. Optimization over matroids and matroid intersections.
- Week 11-12: Submodular functions and optimization.
- Lecture notes by Jan Vondrak (lectures 16-19)
- A survey article by your instructor on continuous extensions of submodular functions and their algorithmic applications.
- The original paper by Laszlo Lovasz on submodular functions and convexity. You may have to use the USC library proxy to get access, or find it elsewhere online.
- The Calinescu et al paper on maximizing a monotone submodular functions subject to a matroid constraint.
- The recent paper by Buchbinder et al on unconstrained maximization of non-monotone submodular functions.
- Slides from a recent tutorial by Jan Vondrak, with an overview of many of the "state of the art" results.
- For those interested in applications of submodularity to machine learning, see the materials and references on this page maintained by Andreas Krause and Carlos Guestrin.
- Week 13-15: Additional topics. We focused on advanced applications of semi-definite programming to approximation algorithms, in particular to constraint satisfaction problems.
Over the past half century or so, computer science and mathematical optimization have witnessed the development and maturity of two different paradigms for algorithm design.
The first approach, most familiar to computer scientists, is combinatorial in nature. The tools of discrete mathematics are used to understand the structure of the problem, and algorithms effectively exploit this structure to search over a large yet finite set of possible solutions. The second approach, standard in much of the operations research and mathematical optimization communities, primarily employs the tools of continuous mathematics, high dimensional geometry, and convex analysis. Problems are posed as a search over a set of points in high-dimensional Euclidean space, which can be performed efficiently when the search space and objective function are ``convex.''
Whereas many optimization problems are best modeled either as a discrete or convex optimization problem, researchers have increasingly discovered that many problems are best tackled by a combination of combinatorial and continuous techniques. The ability to seamlessly transition between the two views has become an important skill to every researcher working in algorithm design and analysis. This course intends to instill this skill by presenting a unified treatment of both approaches, focusing on algorithm design tasks that employ techniques from both. The intended audience for this course are PhD students, Masters students, and advanced undergraduates interested in research questions in algorithm design, mathematical optimization, or related disciplines.
- Prerequisite Courses: CSCI 570 or CSCI 670 or permission of instructor.
- Recommended Preparation: Mathematical maturity and a solid grounding in linear algebra.
Requirements and Grading
Homework assignments will count for 75% of the grade. There will be 4-6 assignments, which will be proof-based, and are intended to be very challenging. Collaboration and discussion among students is allowed, even encouraged, though students must write up their solutions independently.
The remaining 25% of the grade will be allocated to a final project. Students will have to choose a related research topic, read several papers in that area, and write a survey of the area.
Late Homework Policy: Students will be allowed 5 late days for homework, to be used in integer amounts and distributed as the student sees fit. No additional late days are allowed.
We will refer to two main texts: Convex Optimization by Boyd and Vandenberghe, available free online, and Combinatorial Optimization, Fifth edition by Korte and Vygen, available online through USC libraries. Additional references include Combinatorial Optimization by Schrijver, Linear and Nonlinear Programming by Luenberger and Ye, Fourth edition, available online through usc libraries, as well as research papers and lecture notes from related courses elsewhere which will be linked on the course website.