COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
University of Cambridge > Talks.cam > Applied and Computational Analysis > How much patience do you have ? Complexity issues in nonlinear optimization
How much patience do you have ? Complexity issues in nonlinear optimizationAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Carola-Bibiane Schoenlieb. The talk will give a broad outline of the recent advances in worst-case evaluation complexity for the nonlinear (possibly nonconvex) optimization problem. Worst-case bounds will be given for the unconstrained, convexly constrained and general constrained problems, and examples will be shown to prove the sharpness of these bounds. Besides the already remarkable fact that such bounds exist, the analysis brings several surprises related to the impact of constraints on complexity and the worst-case performance of well-known algorithms such as Newton’s method. This talk is part of the Applied and Computational Analysis series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsCCC talks for website Differential Geometry and Topology Seminar Robinson College Cambridge University Global Health Society Cambridge University Eco Racing Sedgwick Club talksOther talksPopulism and Central Bank Independence Nonstationary Gaussian process emulators with covariance mixtures Flow Cytometry Parkinson's Rehabilitation using interactive Dance Technology Positive definite kernels for deterministic and stochastic approximations of (invariant) functions |