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:
“Commerce is unexpectedly confident and serene, alert, adventurous, and unwearied. It is very natural in its methods withal, far more so than many fantastic enterprises and sentimental experiments, and hence its singular success.”
—Henry David Thoreau (1817–1862)
“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 comparison between Coleridge and Johnson is obvious in so far as each held sway chiefly by the power of his tongue. The difference between their methods is so marked that it is tempting, but also unnecessary, to judge one to be inferior to the other. Johnson was robust, combative, and concrete; Coleridge was the opposite. The contrast was perhaps in his mind when he said of Johnson: “his bow-wow manner must have had a good deal to do with the effect produced.””
—Virginia Woolf (1882–1941)