References
| [1] | A.S. Lewis and M.L. Overton. Nonsmooth optimization via bfgs. Submitted to SIAM J. Optimization. |
| [2] | S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, 2004. |
| [3] | Jorge Nocedal and Stephen Wright. Numerical Optimization. Springer, 1999. |
| [4] | M. Haarala, K. Miettinen, and M. M. Makela. New limited memory bundle method for large-scale nonsmooth optimization. Optimization Methods and Software, 19(6):673-692, 2004. |
| [5] | C. G. Broyden. The convergence of a class of double-rank minimization algorithms. Journal of the Institute of Mathematics and Its Applications, (6):76-90, 1970. |
| [6] | R. Fletcher. A new approach to variable metric algorithms. Computer Journal, (13):317-322, 1970. |
| [7] | D. Goldfarb. A family of variable metric updates derived by variational means. Mathematics of Computation, (24):23-26, 1970. |
| [8] | D. F. Shanno. Conditioning of quasi-newton methods for function minimization. Mathematics of Computation, (24):647-656, 1970. |
| [9] | J. Nocedal. Updating quasi-newton matrices with limited storage. Mathematics of Computation, (35):773-782, 1980. |
| [10] | R.H Byrd, J. Nocedal, and R.B. Schnabel. Representations of quasi-newton matrices and their use in limited memory methods. Mathematical Programming, 4(63):129-156, 1994. |
| [11] | W. Hare and C Sagastizabal. A redistributed proximal bundle method for nonconvex optimization. submitted to SIAM J. Opt, 2009. |
| [12] | James V. Burke, Adrian S. Lewis, and Michael L. Overton. The speed of shor's r-algorithm. IMA J. Numer. Anal., (28):711-720, 2008. |
| [13] | L. Luksan, M. Tuma, M. Siska, J. Vlcek, and N. Ramesova. Ufo 2002. interactive system for universal functional optimization. Academy of Sciences of the Czech Republic, 2002. |
This file was generated by bibtex2html 1.93.
All references in bibtex format: bib-file