, Convex Analysis and Minimization Algorithms II, vol. 306 of Grundlehren der mathematischen Wissenschaften, Springer, Berlin, Heidelberg, 1993. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
A Spectral Bundle Method for Semidefinite Programming - Helmberg, Rendl (1997) (50 citations) (Correct)
....method for solving the problem of minimizing the maximal eigenvalue of an affine matrix function with an additional linear objective term. These functions are well known to be convex and non smooth. A very general method for optimizing non smooth convex functions is the bundle method, see e.g. [21, 42, 17, 18]. In each step the function value and a subgradient of the function is computed for some specific point. By means of the collected subgradients a cutting plane model of the function is formed. The minimizer of the cutting plane model augmented by a regularization term yields the new point. In the ....
, Convex Analysis and Minimization Algorithms II, vol. 306 of Grundlehren der mathematischen Wissenschaften, Springer, Berlin, Heidelberg, 1993.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC