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:
“It would be some advantage to live a primitive and frontier life, though in the midst of an outward civilization, if only to learn what are the gross necessaries of life and what methods have been taken to obtain them.”
—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)
“Parents ought, through their own behavior and the values by which they live, to provide direction for their children. But they need to rid themselves of the idea that there are surefire methods which, when well applied, will produce certain predictable results. Whatever we do with and for our children ought to flow from our understanding of and our feelings for the particular situation and the relation we wish to exist between us and our child.”
—Bruno Bettelheim (20th century)