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)
“All men are equally proud. The only difference is that not all take the same methods of showing it.”
—François, Duc De La Rochefoucauld (1613–1680)
“We can best help you to prevent war not by repeating your words and following your methods but by finding new words and creating new methods.”
—Virginia Woolf (1882–1941)