Table of Contents Author Guidelines Submit a Manuscript
Abstract and Applied Analysis
Volume 2014, Article ID 192893, 6 pages
http://dx.doi.org/10.1155/2014/192893
Research Article

A Cutting Plane and Level Stabilization Bundle Method with Inexact Data for Minimizing Nonsmooth Nonconvex Functions

1School of Mathematics, Liaoning Normal University, Dalian 116029, China
2School of Mathematical Sciences, Dalian University of Technology, Dalian 116024, China

Received 12 January 2014; Accepted 20 March 2014; Published 14 April 2014

Academic Editor: Gaohang Yu

Copyright © 2014 Jie Shen et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. E. W. Cheney and A. A. Goldstein, “Newton's method for convex programming and Tchebycheff approximation,” Numerische Mathematik, vol. 1, pp. 253–268, 1959. View at Publisher · View at Google Scholar · View at MathSciNet
  2. J. E. Kelley, Jr., “The cutting-plane method for solving convex programs,” Journal of the Society for Industrial and Applied Mathematics, vol. 8, pp. 703–712, 1960. View at Google Scholar · View at MathSciNet
  3. A. Fuduli, M. Gaudioso, and G. Giallombardo, “Minimizing nonconvex nonsmooth functions via cutting planes and proximity control,” SIAM Journal on Optimization, vol. 14, no. 3, pp. 743–756, 2003. View at Publisher · View at Google Scholar · View at MathSciNet
  4. U. Brannlund, On relaxation methods for nonsmooth convex optimization [Ph.D. thesis], Department of Mathematics, Royal Institute of Technology, Stockholm, Sweden, 1993.
  5. C. Lemaréchal, A. Nemirovskii, and Y. Nesterov, “New variants of bundle methods,” Mathematical Programming, vol. 69, no. 1, pp. 111–147, 1995, Nondifferentiable and large-scale optimization (Geneva, 1992). View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  6. W. de Oliveira and M. Solodov, “A doubly stabilized bundle method for nonsmooth convex optimization,” Tech. Rep., 2013, http://www.optimization-online.org/DB_HTML/2013/04/3828.html.
  7. M. Hintermüller, “A proximal bundle method based on approximate subgradients,” Computational Optimization and Applications, vol. 20, no. 3, pp. 245–266, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  8. F. H. Clarke, Optimization and Nonsmooth Analysis, John Wiley & Sons, New York, NY, USA, 1983. View at MathSciNet
  9. A. A. Goldstein, “Optimization of Lipschitz continuous functions,” Mathematical Programming, vol. 13, no. 1, pp. 14–22, 1977. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  10. K. C. Kiwiel, “A dual method for certain positive semidefinite quadratic programming problems,” SIAM Journal on Scientific and Statistical Computing, vol. 10, no. 1, pp. 175–186, 1989. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  11. A. Fuduli and M. Gaudioso, “The proximal trajectory algorithm for convex minimization,” Tech. Rep. 7/98, Laboratorio di Logistica, Dipartimento di Elettronica Informatica e Sistemistica, Universita della Calabria, Rende Cosenza, Italy, 1998. View at Google Scholar