MA 796s-OR 791k Project Report
December 2007
Max-cut Problem
Lecturer: Kartik Sivaramakrishnan
1
Scribe: Sahar Karimi
Introduction
Max-cut problem is one of many NP-hard graph theory problems which at
A Report on
Approximate Graph Coloring by Semidenite Programming
Pingke Lia , Zhe Liub
a
Edward P. Fitts Department of Industrial and Systems Engineering
North Carolina State University, Raleigh, NC,
CONVEX OPTIMIZATION AND INTERIOR POINT
METHODS
FINAL PROJECT
0/1 INTEGER
PROGRAMMING AND
SEMIDEFINTE
PROGRAMMING
by
Lucia Buch and Natalia Viktorovna
CONTENTS:
1.Introduction
2.Formulation
3.Applicati
December 2007
OR 791K: Convex Optimization and Interior Point Methods
A Summary: Fastest Mixing Markov Chain on a Graph
Prepared for: Dr.Kartik Sivaramakrishnan
1
Prepared by: Susan Osborne
Introducti
MA 796S: Convex Optimization and Interior Point Methods
October 8, 2007
Lecture 1
Lecturer: Kartik Sivaramakrishnan
1
Scribe: Kartik Sivaramakrishnan
Conic programming
Consider the conic program
r
cT
Mixed Linear And Semidenite Programming
For Combinatorial And Quadratic
Optimization
Present by Eric Sullivan and Lu Yu
1
Introduction to the problem
The original problem is:
min
C (vv T ) + cT x := v
MA796S/OR791K: Convex Programming and Interior Point
Methods
Homework 4
Instructor: Dr. Kartik Sivaramakrishnan
INSTRUCTIONS
Due in class on Tuesday, November 13, 2007. You can work in groups of 2-3 s
MA796S/OR791K: Convex Programming and Interior Point
Methods
Homework 3
Instructor: Dr. Kartik Sivaramakrishnan
INSTRUCTIONS
Due in class on Thursday, October 18, 2007. You can work in groups of 2-3 s
MA796S/OR791K: Convex Programming and Interior Point
Methods
Homework 2
Instructor: Dr. Kartik Sivaramakrishnan
INSTRUCTIONS
Due in class on Thursday, September 27, 2007. You can work in groups of 2-3
MA796S/OR791K: Convex Programming and Interior Point
Methods
Homework 1
Instructor: Dr. Kartik Sivaramakrishnan
INSTRUCTIONS
Due in class on Tuesday, September 11, 2007. You can work in groups of 2-3