Unit 1
Introduction – linear algebra fundamentals – Solving linear equations with factored matrices – Block elimination and Schur complements – Convex sets – Convex functions – examples.
| Course Name | Convex Optimization |
| Course Code | 19CCE333 |
| Program | B. Tech. in Computer and Communication Engineering |
| Year Taught | 2019 |
Introduction – linear algebra fundamentals – Solving linear equations with factored matrices – Block elimination and Schur complements – Convex sets – Convex functions – examples.
Classes of Convex Problems – Linear optimization problems – Quadratic optimization problems – Geometric programming – Vector optimization -Reformulating a Problem in Convex Form.
Lagrange Duality Theory and KKT Optimality Conditions – Interior-point methods- Primal and Dual Decompositions – Applications.
Evaluation Pattern
| Assessment | Internal | External |
| Periodical 1 (P1) | 15 | – |
| Periodical 2 (P2) | 15 | – |
| *Continuous Assessment (CA) | 20 | – |
| End Semester | – | 50 |
| *CA – Can be Quizzes, Assignment, Projects, and Reports. | ||
Objectives
Course Outcomes
CO – PO Mapping
| PO/PSO/CO | PO1 | PO2 | PO3 | PO4 | PO5 | PO6 | PO7 | PO8 | PO9 | PO10 | PO11 | PO12 | PSO1 | PSO2 |
| CO1 | 3 | 3 | 3 | 3 | – | – | – | – | – | 3 | – | 3 | 3 | 3 |
| CO2 | 3 | 3 | 3 | 3 | 3 | – | – | – | – | 3 | 2 | 3 | 3 | 3 |
| CO3 | 3 | 3 | 3 | 3 | 3 | – | – | – | – | 3 | 2 | 3 | 3 | 3 |
| CO4 | – | – | – | 3 | 3 | – | – | – | 2 | 3 | 2 | 3 | 3 | 3 |
DISCLAIMER: The appearance of external links on this web site does not constitute endorsement by the School of Biotechnology/Amrita Vishwa Vidyapeetham or the information, products or services contained therein. For other than authorized activities, the Amrita Vishwa Vidyapeetham does not exercise any editorial control over the information you may find at these locations. These links are provided consistent with the stated purpose of this web site.