DBATU TY AI syllabus

DBATU · Third Year B.Tech Artificial Intelligence & Allied · NEP 2020

Optimization Techniques

26AFAIPE604 · Elective II · Semester VI · 3 credits · Continuous assessment 20 + mid-semester 20 + end-semester 60

One of the Elective II options.

All notes for this subject
  1. Unit 1: Preliminaries

    6 hours

    Proofs; vector spaces and matrices; linear transformations; eigenvalues and eigenvectors; orthogonal projections, quadratic forms and matrix norms; concepts from geometry and calculus.

    Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then

    • Linear algebra for optimisation
    • Quadratic forms and matrix norms
  2. Unit 2: Unconstrained Optimisation

    6 hours

    Set-constrained and unconstrained optimisation; one-dimensional search: golden-section and Fibonacci search, Newton's and the secant method; solving Ax = b.

    Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then

    • Optimality conditions
    • Golden-section and Fibonacci search
    • Newton's and secant methods
  3. Unit 3: Linear Programming

    6 hours

    Linear programming, the simplex method and duality.

    Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then

    • Linear programming and duality
    • Simplex and revised simplex methods
  4. Unit 4: Nonlinear Constrained Optimisation

    6 hours

    Problems with equality and inequality constraints; the Karush–Kuhn–Tucker conditions; convex optimisation.

    Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then

    • Equality and inequality constrained problems
    • Karush-Kuhn-Tucker conditions
    • Convex and quadratic programming
  5. Unit 5: Algorithms for Constrained Optimisation

    6 hours

    Projections, projected-gradient methods and penalty methods.

    Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then

    • Projected gradient methods
    • Penalty methods

Unit contents are summarised from the official DBATU syllabus . AiCanCode.org is not affiliated with Dr. Babasaheb Ambedkar Technological University (DBATU).