Convex Optimization - Methods

Methods

Convex minimization problems can be solved by the following contemporary methods:

  • "Bundle methods" (Wolfe, LemarĂ©chal), and
  • Subgradient projection methods (Polyak),
  • Interior-point methods (Nemirovskii and Nesterov).

Other methods of interest:

  • Cutting-plane methods
  • Ellipsoid method
  • Subgradient method

Subgradient methods can be implemented simply and so are widely used.

Read more about this topic:  Convex Optimization

Famous quotes containing the word methods:

    Crime is terribly revealing. Try and vary your methods as you will, your tastes, your habits, your attitude of mind, and your soul is revealed by your actions.
    Agatha Christie (1891–1976)

    The reading public is intellectually adolescent at best, and it is obvious that what is called “significant literature” will only be sold to this public by exactly the same methods as are used to sell it toothpaste, cathartics and automobiles.
    Raymond Chandler (1888–1959)

    How can you tell if you discipline effectively? Ask yourself if your disciplinary methods generally produce lasting results in a manner you find acceptable. Whether your philosophy is democratic or autocratic, whatever techniques you use—reasoning, a “star” chart, time-outs, or spanking—if it doesn’t work, it’s not effective.
    Stanley Turecki (20th century)