This is a preview of subscription content, log in via an institution to check access.
References
Atkinson D.S. and Vaidya P.M. (1999). A Cutting Plane Algorithm for Convex Programming that Uses Analytic Centers.Mathematical Programming 69, 1–43.
Borghetti A., Frangioni A., Lacalandra F. and Nucci C.A. (2003). Lagrangian Heuristics Based on Disaggregated Bundle Methods for Hydrothermal Unit Commitment.IEEE Transactions on Power Systems 18, 313–323.
du Merle O., Goffin J.-L. and Vial J.-P. (1998). On Improvements to the Analytic Center Cutting Plane Method.Computational Optimization and Applications 11, 37–52.
Frangioni A. (2002). Generalized Bundle Methods.SIAM Journal on Optimization 13, 117–156.
Goffin J.-L. and Vial J.-Ph. (2002). Convex nondifferentiable optimization: a survey focussed on the analytic center cutting plane method.Optimization Methods and Software 17, 805–867.
Kiwiel K. (1999). A bundle Bregman proximal method for convex nondifferentiable optimization.Mathematical Programming 85, 241–258.
Larsson T., Patriksson M., and Strömberg A.-B. (1999). Ergodic, Primal Convergence in Dual Subgradient Schemes for Convex Programming.Mathematical Programming 86, 283–312.
Lemaréchal C. and Sagastizábal C. (1998). Variable metric bundle methods: From conceptual to implementable forms.Mathematical Programming 16, 393–410.
Miffin R., Sun D. and Qi L. (1998). Quasi-Newton bundle-type methods for non-differentiable convex optimization.SIAM Journal on Optimization 8, 583–603.
Nesterov Y. (1995). Complexity estimates of some cutting plane methods based on the analytic barrier.Mathematical Programming 69, 149–176.
Rights and permissions
About this article
Cite this article
Antonio Frangioni. Top 11, 215–219 (2003). https://doi.org/10.1007/BF02579040
Issue Date:
DOI: https://doi.org/10.1007/BF02579040