![]() |
![]() |
University of Birmingham > Talks@bham > Optimisation and Numerical Analysis Seminars > Complexity bounds for Optimization
Complexity bounds for OptimizationAdd to your list(s) Download to your calendar using vCal
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:Note that ex-directory lists are not shown. |
Other listsCondensed Matter Group Meetings Particle Physics Seminars School of Mathematics eventsOther talksWaveform modelling and the importance of multipole asymmetry in Gravitational Wave astronomy TBC TBA Quantum Sensing in Space The tragic destiny of Mileva Marić Einstein TBA |