{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T00:42:18Z","timestamp":1760402538372,"version":"build-2065373602"},"reference-count":45,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2020,4,14]],"date-time":"2020-04-14T00:00:00Z","timestamp":1586822400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Natural Science Foundation","award":["11761013"],"award-info":[{"award-number":["11761013"]}]},{"DOI":"10.13039\/501100004607","name":"Guangxi Natural Science Foundation","doi-asserted-by":"publisher","award":["2018GXNSFFA281007"],"award-info":[{"award-number":["2018GXNSFFA281007"]}],"id":[{"id":"10.13039\/501100004607","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>In this paper, we consider a class of structured optimization problems whose objective function is the summation of two convex functions: f and h, which are not necessarily differentiable. We focus particularly on the case where the function f is general and its exact first-order information (function value and subgradient) may be difficult to obtain, while the function h is relatively simple. We propose a generalized alternating linearization bundle method for solving this class of problems, which can handle inexact first-order information of on-demand accuracy. The inexact information can be very general, which covers various oracles, such as inexact, partially inexact and asymptotically exact oracles, and so forth. At each iteration, the algorithm solves two interrelated subproblems: one aims to find the proximal point of the polyhedron model of f plus the linearization of h; the other aims to find the proximal point of the linearization of f plus h. We establish global convergence of the algorithm under different types of inexactness. Finally, some preliminary numerical results on a set of two-stage stochastic linear programming problems show that our method is very encouraging.<\/jats:p>","DOI":"10.3390\/a13040091","type":"journal-article","created":{"date-parts":[[2020,4,15]],"date-time":"2020-04-15T04:01:46Z","timestamp":1586923306000},"page":"91","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Generalized Alternating Linearization Bundle Method for Structured Convex Optimization with Inexact First-Order Oracles"],"prefix":"10.3390","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1649-2217","authenticated-orcid":false,"given":"Chunming","family":"Tang","sequence":"first","affiliation":[{"name":"College of Mathematics and Information Science, Guangxi University, Nanning 540004, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanni","family":"Li","sequence":"additional","affiliation":[{"name":"College of Mathematics and Information Science, Guangxi University, Nanning 540004, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoxia","family":"Dong","sequence":"additional","affiliation":[{"name":"College of Mathematics and Information Science, Guangxi University, Nanning 540004, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"He","sequence":"additional","affiliation":[{"name":"College of Mathematics and Information Science, Guangxi University, Nanning 540004, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2020,4,14]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","article-title":"Compressed sensing","volume":"52","author":"Tsaig","year":"2006","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1007\/s10915-014-9860-y","article-title":"Efficient nonsmooth nonconvex optimization for image restoration and segmentation","volume":"62","author":"Jung","year":"2015","journal-title":"J. Sci. Comput."},{"key":"ref_3","unstructured":"Sar, S., Nowozin, S., and Wright, S.J. (2012). Optimization for Machine Learning, Massachusetts Institute of Technology Press."},{"key":"ref_4","unstructured":"Clarke, F.H., Ledyaev, Y.S., Stern, R.J., and Wolenski, P.R. (1998). Nonsmooth Analysis and Control Theory, Springer."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1858","DOI":"10.1109\/TII.2019.2937513","article-title":"A distributed dual consensus ADMM based on partition for DC-DOPF with carbon emission trading","volume":"16","author":"Yang","year":"2020","journal-title":"IEEE Trans. Ind. Inform."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"732","DOI":"10.1016\/j.apenergy.2016.11.096","article-title":"A novel projected two-binary-variable formulation for unit commitment in power systems","volume":"187","author":"Yang","year":"2017","journal-title":"Appl. Energ."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1109\/TPWRS.2014.2326920","article-title":"Tight relaxation method for unit commitment problem using reformulation and lift-and-project","volume":"30","author":"Yang","year":"2015","journal-title":"IEEE Trans. Power. Syst."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"2606","DOI":"10.1109\/TII.2017.2710055","article-title":"Multiple perspective-cuts outer approximation method for risk-averse operational planning of regional energy service providers","volume":"13","author":"Yang","year":"2017","journal-title":"IEEE Trans. Ind. Inform."},{"key":"ref_9","first-page":"311","article-title":"Bundle methods for regularized risk minimization","volume":"11","author":"Teo","year":"2010","journal-title":"Mach. Learn. Res."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1137\/16M1080173","article-title":"Optimization Methods for Machine Learning","volume":"60","author":"Bottou","year":"2018","journal-title":"SIAM Rev."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1015","DOI":"10.1137\/050639284","article-title":"A proximal-projection bundle method for Lagrangian relaxation, including semidefinite programming","volume":"17","author":"Kiwiel","year":"2006","journal-title":"SIAM J. Optim."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"757","DOI":"10.3934\/jimo.2018069","article-title":"A proximal-projection partial bundle method for convex constrained minimax problems","volume":"15","author":"Tang","year":"2019","journal-title":"J. Ind. Manag. Optim."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1137\/0329006","article-title":"Applications of a splitting algorithm to decomposition in convex programming and variational inequalities","volume":"29","author":"Paul","year":"1991","journal-title":"SIAM Cont. Optim."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1051\/m2an\/1993270303751","article-title":"Partial regularization of the sum of two maximal monotone operators","volume":"27","author":"Mahey","year":"1993","journal-title":"Math. Model. Numer. Anal."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1080\/10556789408805578","article-title":"Some saddle-function splitting methods for convex programming","volume":"4","author":"Eckstein","year":"1994","journal-title":"Optim. Meth. Soft."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/BF00247655","article-title":"Application of the alternating direction method of multipliers to separable convex programming problems","volume":"1","author":"Fukushima","year":"1992","journal-title":"Comput. Optim. Appl."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1137\/110822347","article-title":"Alternating direction method with gaussian back substitution for separable convex programming","volume":"22","author":"He","year":"2012","journal-title":"SIAM J. Optim."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1287\/moor.2016.0822","article-title":"Convergence rate analysis for the alternating direction method of multipliers with a substitution procedure for separable convex","volume":"42","author":"He","year":"2017","journal-title":"Math. Oper. Res."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"1550011","DOI":"10.1142\/S0217595915500116","article-title":"A linearized alternating direction method of multipliers with substitution procedure","volume":"32","author":"Chao","year":"2015","journal-title":"Asia-Pac. Opera. Res."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/s10107-012-0530-2","article-title":"Fast alternating linearization methods for minimizing the sum of two convex functions","volume":"141","author":"Goldfarb","year":"2013","journal-title":"Math. Program"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1137\/S1052623495288064","article-title":"Proximal decomposition via alternating linearization","volume":"9","author":"Kiwiel","year":"1999","journal-title":"SIAM J. Optim."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/s10107-009-0327-0","article-title":"An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems","volume":"130","author":"Kiwiel","year":"2011","journal-title":"Math. Program"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"1180","DOI":"10.1080\/10556788.2013.871282","article-title":"Level bundle methods for oracles with on-demand accuracy","volume":"29","author":"DeOliveira","year":"2014","journal-title":"Optim. Method Softw."},{"key":"ref_24","unstructured":"Kiwiel, K.C. (2009). Bundle Methods for Convex Minimization with Partially Inexact Oracles, Systems Research Institute, Polish Academy of Sciences. Technical Report."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/s10107-014-0809-6","article-title":"Convex proximal bundle methods in depth: A unified analysis for inexact oracles","volume":"148","year":"2014","journal-title":"Math. Program."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BFb0120703","article-title":"A method of conjugate subgradients for minimizing nondifferentiable functions","volume":"3","author":"Wolfe","year":"1975","journal-title":"Math. Program."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/10556780290027828","article-title":"Survey of bundle methods for nonsmooth optimization","volume":"17","year":"2002","journal-title":"Optim. Meth. Soft."},{"key":"ref_28","unstructured":"Bonnans, J.F., Gilbert, J.C., Lemar\u00e9chal, C., and Sagastiz\u00e1bal, C. (2006). Numerical Optimization: Theoretical and Practical Aspects, Springer. [2nd ed.]."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BFb0120700","article-title":"An extension of davidon methods to nondifferentiable problems","volume":"3","year":"1975","journal-title":"Math. Program."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1007\/BF02191984","article-title":"Approximations in proximal bundle methods and decomposition of convex programs","volume":"84","author":"Kiwiel","year":"1995","journal-title":"J. Optim. Theory. Appl."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1023\/A:1011259017643","article-title":"A proximal bundle method based on approximate subgradients","volume":"20","author":"Hintermuller","year":"2001","journal-title":"Comput. Optim. Appl."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1137\/040603929","article-title":"A proximal bundle method with approximate subgradient linearizations","volume":"16","author":"Kiwiel","year":"2006","journal-title":"SIAM J. Optim."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1090\/S0025-5718-1985-0790650-5","article-title":"An algorithm for nonsmooth convex minimization with errors","volume":"45","author":"Kiwiel","year":"1985","journal-title":"Math. Comput."},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Hiriart-Urruty, J.B., and Lemar\u00e9chal, C. (1993). Convex Analysis and Minimization Algorithms. Number 305-306 in Grundlehren der mathematischen Wissenschaften, Springer.","DOI":"10.1007\/978-3-662-02796-7"},{"key":"ref_35","unstructured":"Rockafellar, R.T. (2015). Convex Analysis, Princeton University Press."},{"key":"ref_36","first-page":"5","article-title":"Uncontrolled inexact information within bundle methods","volume":"5","author":"Malick","year":"2017","journal-title":"Eur. J. Oper. Res."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1137\/100808289","article-title":"Inexact bundle methods for two-stage stochastic programming","volume":"21","author":"Scheimberg","year":"2011","journal-title":"SIAM J. Optim."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1137\/S1052623497318700","article-title":"Inexact cuts in benders decomposition","volume":"10","author":"Zakeri","year":"2000","journal-title":"SIAM J. Optim."},{"key":"ref_39","first-page":"35","article-title":"Bundle-type methods for inexact data","volume":"8","year":"2000","journal-title":"Cent. Eur. J. Oper. Res."},{"key":"ref_40","doi-asserted-by":"crossref","unstructured":"Kiwiel, K.C. (1985). Methods of Descent for Nondifferentiable Optimization, Springer. Lecture Notes in Mathematics.","DOI":"10.1007\/BFb0074500"},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Wallace, S.W., and Ziemba, W.T. (2005). Applications of Stochastic Programming, SIAM. MPS-SIAM Ser. Optim.","DOI":"10.1137\/1.9780898718799"},{"key":"ref_42","doi-asserted-by":"crossref","unstructured":"Shapiro, A., Dentcheva, D., and Ruszczy\u0144ski, A. (2014). Lectures on Stochastic Programming: Modeling and Theory, SIAM.","DOI":"10.1137\/1.9781611973433"},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-013-0737-x","article-title":"Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization","volume":"149","author":"Lan","year":"2015","journal-title":"Math. Program"},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/BF02110042","article-title":"Network planning with random demand","volume":"3","author":"Sen","year":"1994","journal-title":"Telecommun. Syst."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/S0167-6377(98)00054-6","article-title":"Monte Carlo bounding techniques for determining solution quality in stochastic programs","volume":"24","author":"Mak","year":"1999","journal-title":"Oper. Res. Lett."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/13\/4\/91\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T13:44:54Z","timestamp":1760363094000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/13\/4\/91"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,14]]},"references-count":45,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2020,4]]}},"alternative-id":["a13040091"],"URL":"https:\/\/doi.org\/10.3390\/a13040091","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2020,4,14]]}}}