AMSC 607 /CMSC 764 Term Project Information
For your project,
do one of the following:
Deadlines and points:
What to submit for the project:
Your project must have these four components:
How to submit:
Submit your project by e-mail. The time stamp on the
e-mail will determine whether the project is on time or late.
I'll acknowledge your submission by e-mail after I have successfully
extracted the files.
Some questions that will be asked while evaluating a project:
Warning:
The only failing grades I have given on term projects have been for
lateness or for plagiarism. If you use someone's ideas, cite the source.
If you use a direct quote, use quotation marks and cite the
source. And don't expect a good grade on a project that is
mostly someone else's work.
How to get started:
Each person is required to have a unique project, so
tell me your idea, and I will add it to the list
of claimed topics on this page.
If you can't think of a topic,
check the
Survival Guide for Optimization
for journals and other sources of information, especially
Optimization Online, which is an excellent source of papers.
If you don't have any ideas after that, let's talk.
A note on software:
Matlab does not have internal software for solving these problems, but there are several Matlab packages available on the web.
I advise you to find one and modify it (if necessary) for your purposes
rather than writing one from scratch.
Projects chosen by students this semester:
Your project must be unique,
so either pick a different topic or
check with me to make sure that your ideas are
sufficiently different from what other students chose.
Avoiding numerical cancellation in the IPM for solving SDPs. J. Sturm
Lagrangian Dual Interior-Point Methods for SDP
Mituhiro Fukuda, Masakazu Kojima, and Masayuki Shida
First and 2nd order methods for SDP
R. Montiero
Solving Large Scale Semidefinite Programs via an Iterative Solver on the Augmented Systems
K-C Toh
Unsupervised Learning of Image Manifolds by SDP.
Weinberger and Saul,
Invariant Pattern Recognition by SDP Machines.
Thore Graepel, Ralf Herbrich
Ensemble Pruning Via Semi-definite Programming.
Yi Zhang, Samuel Burer, W. Nick Street
Learning the Kernel
Matrix with SDP.
Kocvara and Stingl
Growing well-connected graphs.
Arpita Ghosh and Stephen Boyd
Semidefinite relaxation for detection of
16-QAM signaling in MIMO channels
Weisel, Eldar, Shamai
On The Design of Real and Complex FIR Filters with
Flatness and Peak Error Constraints Using SDP.
S. C. Chan and K. M. Tsui
Clustering via Minimum Volume Ellipsoids
R. Shioda and L. Tuncel
SDP approaches for sensor network localization with
noisy measurements
Biswas, Liang, Toh, Wang, Ye
Binary partitioning, perceptual grouping, and restoration
with semidefinite programming
Keuchel, J.; Schnorr, C.; Schellewald, C.; Cremers, D
The application of SDP for detection in CDMA
P.H. Tan and L. K. Rasmussen
Optimal compactions gain by eigenvalue minimization
C. Popeea and B. Dumitrescu
Constructing self-concordant barriers for convex cones
Y. Nesterov
Distributed transmit beamforming in cellular networks
A. Ekbal and J.M. Cioffi
...