University of Birmingham > Talks@bham > Optimisation and Numerical Analysis Seminars > Complexity bounds for Optimization

  Browse A-Z

Log in

System Admin (disabled)details Birmingham usersdetails No account?details

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

Complexity bounds for Optimization

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

  • UserJinyuan Yuan (Universidade Federal do Paraná, Brazil)
  • ClockMonday 19 February 2018, 12:00-13:00
  • HouseR17/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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Theoretical Physics Seminars Metallurgy & Materials – Tech Entrepreneurship Seminar Series Data Science and Computational Statistics Seminar

Other talks

Geometry of alternating projections in metric spaces with bounded curvature Disorder relevance for non-convex random gradient Gibbs measures in d=2 Ultrafast, all-optical, and highly efficient imaging of molecular chirality Provably Convergent Plug-and-Play Quasi-Newton Methods for Imaging Inverse Problems Sensing and metrology activities at NPL, India TBC
 

Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on talks.cam from the University of Cambridge.