• LOGIN
  • No products in the cart.

You must be logged in to take this course  →   LOGIN | REGISTER NOW

This course aims to give students the tools and training to recognize convex optimization problems that arise in scientific and engineering applications, presenting the basic theory, and concentrating on modeling aspects and results that are useful in applications. Topics include convex sets, convex functions, optimality conditions, and duality theory. Addition to that, applications to signal processing, control, and analogue circuit design will be discussed in this course.

Assessment

This course does not involve any written exams. Students need to answer 5 assignment questions to complete the course, the answers will be in the form of written work in pdf or word. Students can write the answers in their own time. Each answer needs to be 200 words (1 Page). Once the answers are submitted, the tutor will check and assess the work.

Certification

Edukite courses are free to study. To successfully complete a course you must submit all the assignment of the course as part of the assessment. Upon successful completion of a course, you can choose to make your achievement formal by obtaining your Certificate at a cost of £49.

Having an Official Edukite Certification is a great way to celebrate and share your success. You can:

  • Add the certificate to your CV or resume and brighten up your career
  • Show it to prove your success

 

 

Course Credit: MIT

Course Curriculum

Module 01
Introduction 00:10:00
Convex sets 00:30:00
Convex functions 00:40:00
Convex optimization problems 01:05:00
Duality 00:40:00
Approximation and fitting 00:25:00
Statistical estimation 00:20:00
Geometric problems 00:25:00
Filter design and equalization 00:40:00
Miscellaneous applications 00:30:00
Module 02
l1 methods for convex-cardinality problems 00:40:00
l1 methods for convex-cardinality problems (cont.) 00:30:00
Stochastic programming 00:30:00
Chance constrained optimization 00:30:00
Numerical linear algebra background 00:25:00
Unconstrained minimization 00:40:00
Equality constrained minimization 00:25:00
Interior-point methods 00:40:00
Disciplined convex programming and CVX 00:35:00
Assessment
Submit Your Assignment 00:00:00
Certification 00:00:00

Course Reviews

4.7

4.7
8 ratings
  • 5 stars0
  • 4 stars0
  • 3 stars0
  • 2 stars0
  • 1 stars0

No Reviews found for this course.

661 STUDENTS ENROLLED
©2021 Edukite. All Rights Resereved
Edukite is A Part Of Ebrahim College, Charity Commission
Reg No 110841