LB.jemdoc

# jemdoc: menu{MENU}{LB.html}
= Lower Bounds in Convex/Nonconvex Optimization

~~~
This page aims to collect recent research efforts on lower bounds, which suggests the optimality of existing state-of-the-art algorithms (or the tightness of existing best lower bounds). 

\n\n

/P.S. Of course the results here are not exhaustive and may be not fully correct, any comments are welcome./
~~~

~~~
{}{img_center}{figs/Complexity_Understanding.jpg}{alt text}{1050px}{300px}{}
\n
Understanding of Optimization Complexity Analysis (/Source:  [https://xu-yangyang.github.io/index.html Yangyang Xu] and [https://www2.eecs.berkeley.edu/Pubs/TechRpts/2019/EECS-2019-53.pdf Chi Jin]/)
~~~

== Convex Deterministic Optimization
- To be completed

== Convex Finite-Sum / Stochastic Optimization
- To be completed

== Nonconvex Deterministic Optimization
- To be completed

== Nonconvex Finite-Sum / Stochastic Optimization
- To be completed

== Convex-Concave Deterministic Min-Max Optimization
- To be completed

== Convex-Concave Finite-Sum / Stochastic Min-Max Optimization
- To be completed