Scribd
Upload
85 views1 page

Optimization Techniques

This document outlines the course content for Ad Optimization Techniques, a major elective course for the Electronics and Communication Engineering program at Gujarat Technological University. The course covers various optimization techniques including linear programming, unconstrained optimization methods like gradient descent and Newton's method, constrained optimization using penalty functions and augmented Lagrangian methods, and sequential quadratic programming. Reference materials include the book Nonlinear Programming by Bazaraa, Sherali, and Shetty.

Uploaded by

DHIREN
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
85 views1 page

Optimization Techniques

This document outlines the course content for Ad Optimization Techniques, a major elective course for the Electronics and Communication Engineering program at Gujarat Technological University. The course covers various optimization techniques including linear programming, unconstrained optimization methods like gradient descent and Newton's method, constrained optimization using penalty functions and augmented Lagrangian methods, and sequential quadratic programming. Reference materials include the book Nonlinear Programming by Bazaraa, Sherali, and Shetty.

Uploaded by

DHIREN
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

GUJARAT TECHNOLOGICAL UNIVERSITY

M.E. Semester: III


Electronics and Communication Engineering
Subject Name:
Ad Optimization Techniques (Major Elective - IV)

Sr. Course content


No
1. Motivation. Mathematical review, matrix factorization, sets and sequences, convex
sets and functions.

2. Linear programming and simplex methods, Weierstrass’ Theorem, Karush Kuhn


Tucker optimality conditions, algorithms, convergence.

3. Unconstrained optimization, Line search methods, method of multidimensional


search, method of multi dimensional search, steepest descent methods, Newton’s
method, trust region methods, conjugate gradient methods, quasi-Newton’s methods.

4. Constrained optimization, penalty and barrier function methods, augmented


Lagrangian methods, Polynomial time algorithm for linear programming.

5. Successive linear programming, successive quadratic programming.

Reference Books:
M.S.Bazaraa, H.D.Sherali and C. Shetty, Nonlinear Programming theory and Algorithms,
John Wiley and Sons, New York.

You might also like