Recent Trends in Convex Optimization; Theory, Algorithms and Applications

This online CEP will provide a forum for reviewing and discussing all aspects of convex optimization theory, both for scalar and multi objective optimization problems and several algorithms, which are widely used to solve convex optimization problems. The programme includes, but is not limited to the following topics:

  • Basics of Convex Optimization Theory
  • Steepest Descent Method
  • Accelerated Gradient Descent Method
  • Sub gradient Methodand Complexity Analysis
  • Modified Newton’s Method
  • Interior Pointand Lemke’s Algorithms
  • Applications in Machine Learning & Signal Processing

Click Here for details...