This action might not be possible to undo. Are you sure you want to continue?

Lecture Schedule Credit Hours Instructor Office Teaching Assistant Office Thursday 8:00 am – 11:00 am Three Muhammad Tahir Semester Pre-requisite Contact Office Hours Spring 2014 Linear Algebra, Set theory mtahir@uet.edu.pk Monday 14:00 – 15:00, Saturday 10:00 – 11:00 N/A N/A

None N/A

Lab Schedule Office Hours

Course Description

This course will be covering two distinct areas: 1) Linear optimization (also called linear programming) and 2) Nonlinear optimization, techniques. Linear programming part will cover the following topics: Introduction to convex sets Geometry of linear programming Simplex method, duality theory Nonlinear programming part will cover the following topics: Introduction to convex functions Quadratic programming Convex programming Geometric programming The objective of this course is to make students acquire a systematic understanding of optimization techniques. The course will start with linear optimization (being the simplest of all optimization techniques) and will discuss in detail the problem formulation and the solution approaches. Then we will cover a class of nonlinear optimization problems where the optimal solution is also globally optimal, i.e. convex nonlinear optimization and its variants. In the discussion of different optimization techniques, some well known research problems in the domain of electrical engineering will also be discussed. In addition, the students are expected to learn the use of different optimization solvers including MATLAB optimization tool box, Mosek etc. Required: 1) Introduction to Linear Optimization by Dimitris Bertsimas & John N. Tsitsiklis, Athena Scientific 1997.

Expected Outcomes

Textbooks

2) Convex Optimization by S. Boyd & L. Vandenberghe Cambridge Univ. Press, 2004. References: Engineering Optimization: Theory and Practice by S. S. Rao , John Wiley & Sons 2009. Assignments: Quizzes: Midterm: Final: 10% 10% 30% 50%

Grading Policy

Objective function. linear algebra background. vertices. Quasiconvex functions. primal decomposition. identifying an optimal point. Nonlinear optimization. Lagrange dual function. primal-dual relations. duality theorem. duality gap Sensitivity Analysis Relaxing or tightening of constraints Distributed Optimization Optimization problem decomposition. geometric optimization. Convex optimization MIDTERM Convex Functions Operations preserving convexity. extreme points. optimality conditions. graphical representation for two dimensional space Convex Sets and Geometry of Linear Programming Affine and convex sets. conjugate function. quadratic optimization.Tentative . Log-concave and log-convex functions. Problem constraints and constraint surface. dual decomposition. two phases of simplex algorithm. Duality Theory Duality. development of simplex algorithm. dual problem. computational complexity of simplex algorithm Duality Theory Duality in linear programming. geometric interpretation. existence of extreme points. Convexity with respect to generalized inequalities Convex Optimization Convex optimization problems. point methods Readings Class notes 1* Chapter 1 (T1) 2* Chapter 2 (T1 + T2) 2* Chapter 3 (T1) 1* Chapter 4 (T1) 1* 1 Chapter 1 (T2) 2* Chapter 3 (T2) 2* 1* 1* 1* Chapter 4 (T2) Chapter 5 (T2) Chapter 5 (T2) Notes * . separating and supporting hyperplanes Simplex Algorithm Optimality conditions. dual simplex method. Classification of optimization problems Linear Programming Variants of linear programming. examples of linear programming problems. optimal dual variables Introduction to Nonlinear Optimization Least-squares & linear optimization.Lecture Plan Weeks 1* Topics Introduction to Optimization Statement of optimization. column geometry of simplex algorithm. polyhedra. optimality of extreme points convexity preserving operations.

- Addressing Modes
- Lecture 5 - Basic Instruction Set
- COURSE-OUTLINE.pdf
- Course Outline
- Course Outline DLD
- COURSE OUTLINE SIGNAL AND SYSTEM
- Course Outline-circuit analysis
- s 0036144598336745
- Visual Cryptography
- Jpeg
- ANSWER 3
- Resistors Capacitors
- LAB MANUAL
- ece_311
- LAB MANUAL BASIC ELECTRONICS
- 76 ENCY Nonlinear Estim
- 6.262-4vaw
- chap9
- BCH Decoding
- Poisson CDF Table
- 2688 Cs Curriculum 09
- Poisson
- section6_1
- Standard Normal Table
- L5.notes

Course outline optimization theory

Course outline optimization theory

- Week 7 - Exact Solving Techniques
- mat-26-4-2-0109-3.pdf
- Lecture 1
- Optimization Handout AAOC222 Sem1 2012 13
- Optimisation techniques Syllabus BIT Mesra.pdf
- modB
- ENT331_L002_LP
- Introduction to Optimization Techniques
- Fuzzy Linear Programming
- PhD Glineur Topics in Convex Optimization
- 379 Course Description 10
- Exam+3 Sample (1)
- natcor_ip_rest.pdf
- Tutorial 1
- OPERATION RESEARCH
- Operation Research
- SET PACKING PROBLEM WITH LINEAR FRACTIONAL OBJECTIVE FUNCTION
- 4-Optimization Linear Programming
- Linear Programming
- Chapter 14
- For DCOPF
- Optimization Questions
- optimization.pdf
- OR Notes
- Lecture 10-2011.pdf
- Notes on optimization-2
- Batch Planning and Resource Allocation - Laboratory 2
- maa2003.ppt
- MATH_F212_1122.pdf
- Management Science Lecture Notes
- EE505 Optimization Theory 2014

Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

We've moved you to where you read on your other device.

Get the full title to continue

Get the full title to continue reading from where you left off, or restart the preview.

scribd