·
Nonlinear
Programming, MIT OCW, 2004
·
Nonlinear
Programming, MIT OCW, 2003
·
Convex
Optimization,
·
Auctions Reading Group,
On Application of Duality
and Network Resource Allocation
[1]. Optimization
Flow Control, I: Basic Algorithm and Convergence, S. H. Low and D. E. Lapsley, IEEE/ACM Transactions on Networking, 7(6):861-75,
December 1999.
[2]. Rate
control in communication networks: shadow prices, proportional fairness and
stability, F. P. Kelly, A.K. Maulloo and D. K. H.
Tan, Journal of the Operational Research Society 49 (1998), 237-252.
On Game Theory
[3]. How bad is selfish
routing?, T. Roughgarden and E. Tardos,Journal of the ACM, 2002.
[4]. More
to be added
TIME |
Material |
Comments |
|
Newton’s Method in Unconstrained Optimization Problem, Chapter 1, BER |
Notes, Supplement on Matrices |
|
Lagrange’s Necessary Condition from Penalty and Elimination Approaches, Chapter 3, BER |
Notes, Summary |
|
Projection Theorem, Chapter 2, BER |
Notes, Summary |
|
Lagrange’s Sufficient Conditions and Sensitivity Analysis |
Notes, Summary |
|
TBA |
Notes, Summary |
|
KKT and Fritz-John Optimality Conditions, Chapter 3, BER |
Notes, Summary |
|
TBA |
Notes, Summary |
|
Linear Constraints and Duality, Chapter 3, BER |
Notes, Summary |
|
TBA |
Notes, Summary |
|
Duality Theory I, Chapter 5,BER |
Notes, Summary |
|
TBA |
Notes, Summary |
|
Duality Theory II, Chapter 5,BER |
Notes, Summary |
|
TBA |
Notes, Summary |
|
Duality Theory III, Chapter 5,BER |
Notes, Summary |
|
TBA |
Notes, Summary |
|
Duality Theory IV, Chapter 5,BER |
Notes, Summary |
|
TBA |
Notes, Summary |