Bibliography (7):

1. Logarithmic regret algorithms for online convex optimization

2. A Steepest-Ascent Method for Solving Optimum Programming Problems

3. Stochastic Constraint Programming as Reinforcement Learning

4. Algorithmic Progress in Six Domains

5. Smooth markets: A basic mechanism for organizing gradient-based learners

6. Wikipedia Bibliography:

   1. https://en.wikipedia.org/wiki/Convex_optimization

      https://en.wikipedia.org/wiki/Convex_optimization

   2. Gradient descent