Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2015 (2015), Article ID 215310, 9 pages
http://dx.doi.org/10.1155/2015/215310
Research Article

An Approximate Redistributed Proximal 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 6 January 2015; Revised 28 April 2015; Accepted 28 April 2015

Academic Editor: Anna Pandolfi

Copyright © 2015 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. 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 · View at Scopus
  2. K. C. Kiwiel, “Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization,” Mathematical Programming, vol. 52, no. 2, pp. 285–302, 1991. View at Publisher · View at Google Scholar · View at MathSciNet
  3. L.-P. Pang, Z.-Q. Xia, and L.-W. Zhang, “On a second order parallel variable transformation approach,” Journal of Applied Mathematics & Computing, vol. 11, no. 1-2, pp. 201–213, 2003. View at Publisher · View at Google Scholar · View at MathSciNet
  4. L.-P. Pang and Z.-Q. Xia, “A PVT-type algorithm for minimizing a nonsmooth convex function,” Serdica. Mathematical Journal, vol. 29, no. 1, pp. 11–32, 2003. View at Google Scholar · View at MathSciNet
  5. C. Lemaréchal, “Lagrangian relaxation,” in Computational Combinatorial Optimization, vol. 2241 of Lecture Notes in Computer Science, pp. 112–156, Springer, Berlin, Germany, 2001. View at Publisher · View at Google Scholar · View at MathSciNet
  6. 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 · View at Scopus
  7. J. E. Kelley Jr., “The cutting-plane method for solving convex programs,” Journal of the Society for Industrial and Applied Mathematics, vol. 8, no. 4, pp. 703–712, 1960. View at Google Scholar · View at MathSciNet
  8. N. Haarala, K. Miettinen, and M. Makela, “Globally convergent limited memory bundle method for large-scale nonsmooth optimization,” Mathematical Programming Series A, vol. 109, no. 1, pp. 181–205, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  9. A. Fuduli, M. Gaudioso, and G. Giallombardo, “A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization,” Optimization Methods & Software, vol. 19, no. 1, pp. 89–102, 2004. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  10. K. C. Kiwiel, “A linearization algorithm for nonsmooth minimization,” Mathematics of Operations Research, vol. 10, no. 2, pp. 185–194, 1985. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  11. K. C. Kiwiel, “Restricted step and Levenberg-Marquardt techniques in proximal bundle methods for nonconvex nondifferentiable optimization,” SIAM Journal on Optimization, vol. 6, no. 1, pp. 227–249, 1996. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. L. Luksan and J. Vlcek, “A bundle-Newton method for nonsmooth unconstrained minimization,” Mathematical Programming, vol. 83, no. 1–3, pp. 373–391, 1998. View at Google Scholar
  13. J.-B. Hiriart-Urruty and C. Lemarechal, Convex Analysis and Minimization Algorithms II: Advanced Theory and Bundle Methods, vol. 306 of Grundlehren der Mathematischen Wissenschaften, Springer, Berlin, Germany, 1993.
  14. J. Shen, Z.-Q. Xia, and L.-P. Pang, “A proximal bundle method with inexact data for convex nondifferentiable minimization,” Nonlinear Analysis. Theory, Methods & Applications, vol. 66, no. 9, pp. 2016–2027, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. J. Shen and L.-P. Pang, “A bundle-type auxiliary problem method for solving generalized variational-like inequalities,” Computers and Mathematics with Applications, vol. 55, no. 12, pp. 2993–2998, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  16. J. Shen and L.-P. Pang, “An approximate bundle-type auxiliary problem method for solving generalized variational inequalities,” Mathematical and Computer Modelling, vol. 48, no. 5-6, pp. 769–775, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  17. R. T. Rockafellar and J. J.-B. Wets, Variational Analysis, vol. 317 of Grundlemren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], Springer, Berlin, Germany, 1998.
  18. W. Hare and C. Sagastizabal, “A redistributed proximal bundle method for nonconvex optimization,” SIAM Journal on Optimization, vol. 20, no. 5, pp. 2442–2473, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  19. W. Hare and C. Sagastizábal, “Computing proximal points of nonconvex functions,” Mathematical Programming, vol. 116, no. 1-2, pp. 221–258, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  20. D. Noll, O. Prot, and A. Rondepierre, “A proximity control algorithm to minimize nonsmooth and nonconvex functions,” Pacific Journal of Optimization, vol. 4, no. 3, pp. 569–602, 2008. View at Google Scholar · View at MathSciNet
  21. W. de Oliveira, C. Sagastizábal, and C. Lemaréchal, “Convex proximal bundle methods in depth: a unified analysis for inexact oracles,” Mathematical Programming Series B, vol. 148, no. 1-2, pp. 241–277, 2014. View at Publisher · View at Google Scholar · View at MathSciNet