Complexity bounds for Optimization

Add to your list(s) Download to your calendar using vCal

• Jinyuan Yuan (Universidade Federal do Paraná, Brazil)
• Monday 19 February 2018, 12:00-13:00
• R17/18 Watson.

If you have a question about this talk, please contact Sergey Sergeev.

In this talk, I am going to focus on the complexity analysis for both the well-case and the worst-case of optimization algorithms. Also I will give a formal complexity analysis for some unconstrained optimization and constrained optimization problems, respectively. Some new complexity results will be discussed as well.

This talk is part of the Optimisation and Numerical Analysis Seminars series.

This talk is included in these lists:

• Optimisation and Numerical Analysis Seminars
• R17/18 Watson
• School of Mathematics events

Note that ex-directory lists are not shown.