{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T13:09:37Z","timestamp":1762520977746},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T00:00:00Z","timestamp":1114646400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2005,9]]},"DOI":"10.1007\/s10107-005-0593-4","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T14:10:42Z","timestamp":1114697442000},"page":"129-151","source":"Crossref","is-referenced-by-count":50,"title":["A primal-proximal heuristic applied to the French Unit-commitment problem"],"prefix":"10.1007","volume":"104","author":[{"given":"L.","family":"Dubost","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Gonzalez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Lemar\u00e9chal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,4,28]]},"reference":[{"key":"593_CR1","unstructured":"Anstreicher, K., Wolsey, L.A.: On dual solutions in subgradient optimization. Unpublished manuscript, CORE, Louvain-la-Neuve, Belgium, 1993"},{"key":"593_CR2","unstructured":"Arrow, K.J., Hurwicz, L.: Reduction of constrained maxima to saddle point problems. In: Neyman, J. (ed.) Proceedings of the 3rd Berkeley Symposium on Mathematical Statistics and Probability, University of California Press, Berkeley, 1956, pp. 1\u201326"},{"key":"593_CR3","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1109\/59.373972","volume":"10","author":"Baldick","year":"1","unstructured":"Baldick, J.: The generalized unit commitment problem. IEEE Transactions on Power Systems 10 (1), 465\u2013475 (1995)","journal-title":"IEEE Transactions on Power Systems"},{"key":"593_CR4","doi-asserted-by":"crossref","first-page":"982","DOI":"10.1109\/59.207311","volume":"7","author":"Batut","year":"3","unstructured":"Batut, J., Renaud, A.: Daily generation scheduling with transmission constraints: a new class of algorithms. IEEE Transactions on Power Systems 7 (3), 982\u2013989 (1992)","journal-title":"IEEE Transactions on Power Systems"},{"key":"593_CR5","unstructured":"Bellman, R., Kalaba, R., Lockett, J.: Numerical Inversion of the Laplace Transform. Elsevier, 1966"},{"key":"593_CR6","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF00937167","volume":"29","author":"Bertsekas","year":"1979","unstructured":"Bertsekas, D.P.: Convexification procedures and decomposition methods for nonconvex optimization problems. Journal of Optimization Theory and Applications 29, 169\u2013197 (1979)","journal-title":"Journal of Optimization Theory and Applications"},{"key":"593_CR7","unstructured":"Bertsekas, D.P.: Nonlinear Programming. Athena Scientific, 1995"},{"key":"593_CR8","doi-asserted-by":"crossref","unstructured":"Bertsekas, D.P., Lauer, G.S., Sandell, N.R., Posberg, T.A.: Optimal short-term scheduling of large-scale power systems. IEEE Transactions on Automatic Control AC-28, 1\u201311 (1983)","DOI":"10.1109\/TAC.1983.1103136"},{"key":"593_CR9","doi-asserted-by":"crossref","unstructured":"Bonnans, J.F., Gilbert, J.Ch., Lemar\u00e9chal, C., Sagastiz\u00e1bal, C.: Numerical Optimization. Springer Verlag, 2003","DOI":"10.1007\/978-3-662-05078-1"},{"key":"593_CR10","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BF01386389","volume":"1","author":"Cheney","year":"1959","unstructured":"Cheney, E., Goldstein, A.: Newton\u2019s method for convex programming and Tchebycheff approximations. Numer. Math. 1, 253\u2013268 (1959)","journal-title":"Numer. Math."},{"key":"593_CR11","unstructured":"CIGRE SC 38. Task Force 38-04-01. Unit commitment, final report, 1997"},{"key":"593_CR12","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/BF00934554","volume":"32","author":"Cohen","year":"1980","unstructured":"Cohen, G.: Auxiliary problem principle and decomposition of optimization problems. J. Optim. Theory Appl. 32, 277\u2013305 (1980)","journal-title":"J. Optim. Theory Appl."},{"key":"593_CR13","unstructured":"Daniilidis, A., Lemar\u00e9chal, C.: On a primal-proximal heuristic in discrete optimization. To appear in Mathematical Programming. Also available as: Inria Research Report 4550, http:\/\/www.inria.fr\/rrrt\/rr-4550.html."},{"key":"593_CR14","doi-asserted-by":"crossref","first-page":"534","DOI":"10.1137\/0307039","volume":"7","author":"Falk","year":"4","unstructured":"Falk, J.E.: Lagrange multipliers and nonconvex programs. SIAM J. Cont. 7 (4), 534\u2013545 (1969)","journal-title":"SIAM J. Cont."},{"key":"593_CR15","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1137\/S1052623498332336","volume":"10","author":"Feltenmark","year":"3","unstructured":"Feltenmark, S., Kiwiel, K.C.: Dual applications of proximal bundle methods, including Lagrangian relaxation of nonconvex problems. SIAM J. Optim. 10 (3), 697\u2013721 (2000)","journal-title":"SIAM J. Optim."},{"key":"593_CR16","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1007\/978-3-642-60744-8_43","volume":"1996","author":"Feltenmark","year":"1997","unstructured":"Feltenmark, S., Kiwiel, K.C., Lindberg, P.O.: Solving unit commitment problems in power production planning. In: U. Zimmermann (ed.) Operations Research Proceedings 1996, 236\u2013241 (1997)","journal-title":"In: U. Zimmermann (ed.) Operations Research Proceedings"},{"key":"593_CR17","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1287\/opre.18.3.375","volume":"18","author":"Geoffrion","year":"3","unstructured":"Geoffrion, A.M.: Primal resource-directive approaches for optimizing nonlinear decomposable systems. Operations Research 18 (3), 375\u2013403 (1970)","journal-title":"Operations Research"},{"key":"593_CR18","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1023\/A:1018947401538","volume":"96","author":"Gollmer","year":"2000","unstructured":"Gollmer, R., Nowak, M.P., R\u00f6misch, W., Schultz, R.: Unit commitment in power generation \u2013 a basic model and some extensions. Annals of Operations Research 96, 167\u2013189 (2000)","journal-title":"Annals of Operations Research"},{"key":"593_CR19","unstructured":"Gonzalez, R., Bongrain, M.P., Renaud, A.: Unit commitment handling transmission constraints with an interior point method. In Proceedings of the 13th PSCC conference, Trondheim, 2, 715\u2013723 (1999)"},{"key":"593_CR20","unstructured":"Gr\u00f6we-Kuska, N., R\u00f6misch, W.: Stochastic unit commitment in hydro-thermal power production planning. In: S.W. Wallace, W.T. Ziemba (eds.), Applications of Stochastic Programming, Series in Optimization. SIAM Publications, MPS\u2013SIAM, 2004"},{"key":"593_CR21","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF02592954","volume":"39","author":"Guignard","year":"2","unstructured":"Guignard, M., Kim, S.: Lagrangean decomposition: a model yielding stronger Lagrangean bounds. Mathematical Programming 39 (2), 215\u2013228 (1987)","journal-title":"Mathematical Programming"},{"key":"593_CR22","first-page":"307","volume":"21","author":"Guignard","year":"4","unstructured":"Guignard, M., Kim, S.: Lagrangean decomposition for integer programming: theory and applications. RAIRO Recherche Op\u00e9rationnelle 21 (4), 307\u2013323 (1987)","journal-title":"RAIRO Recherche Op\u00e9rationnelle"},{"key":"593_CR23","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF00927673","volume":"4","author":"Hestenes","year":"1969","unstructured":"Hestenes, M.R.: Multiplier and gradient methods. J. Optim. Theory Appl. 4, 303\u2013320 (1969)","journal-title":"J. Optim. Theory Appl."},{"key":"593_CR24","doi-asserted-by":"crossref","unstructured":"Hiriart-Urruty, J.-B., Lemar\u00e9chal, C.: Convex Analysis and Minimization Algorithms. Springer Verlag, Heidelberg, 1993. Two volumes","DOI":"10.1007\/978-3-662-02796-7"},{"key":"593_CR25","doi-asserted-by":"crossref","unstructured":"Hiriart-Urruty, J.-B., Lemar\u00e9chal, C.: Convex Analysis and Minimization Algorithms. Springer Verlag, Heidelberg, 1993. Two volumes","DOI":"10.1007\/978-3-662-02796-7"},{"key":"593_CR26","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1137\/0108053","volume":"8","author":"Kelley","year":"1960","unstructured":"Kelley, J.E.: The cutting plane method for solving convex programs. J. Soc. Indust. Appl. Math. 8, 703\u2013712 (1960)","journal-title":"J. Soc. Indust. Appl. Math."},{"key":"593_CR27","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1137\/0910013","volume":"10","author":"Kiwiel","year":"1","unstructured":"Kiwiel, K.C.: A dual method for certain positive semidefinite quadratic programming problems. SIAM Journal on Scientific and Statistical Computing 10 (1), 175\u2013186 (1989)","journal-title":"SIAM Journal on Scientific and Statistical Computing"},{"key":"593_CR28","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/s002110050065","volume":"68","author":"Kiwiel","year":"1994","unstructured":"Kiwiel, K.C.: A Cholesky dual method for proximal piecewise linear programming. Numer. Math. 68, 325\u2013340 (1994)","journal-title":"Numer. Math."},{"key":"593_CR29","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/s101070050090","volume":"86","author":"Larsson","year":"2","unstructured":"Larsson, T., Patriksson, M., Str\u00f6mberg, A.B.: Ergodic, primal convergence in dual subgradient schemes for convex programming. Mathematical Programming 86 (2), 283\u2013312 (1999)","journal-title":"Mathematical Programming"},{"key":"593_CR30","doi-asserted-by":"crossref","unstructured":"Lemar\u00e9chal, C.: Lagrangian relaxation. In: M. J\u00fcnger, D. Naddef (eds.), Computational Combinatorial Optimization, Springer Verlag, Heidelberg, 2001, pp. 115\u2013160","DOI":"10.1007\/3-540-45586-8_4"},{"key":"593_CR31","doi-asserted-by":"crossref","unstructured":"Lemar\u00e9chal, C.: The omnipresence of Lagrange. 4OR, 1 (1), 7\u201325 (2003)","DOI":"10.1007\/s10288-002-0003-1"},{"key":"593_CR32","doi-asserted-by":"crossref","unstructured":"Lemar\u00e9chal, C., Pellegrino, F., Renaud, A., Sagastiz\u00e1bal, C.: Bundle methods applied to the unit-commitment problem. In: J. Dolezal, J. Fidler (eds.), System Modelling and Optimization, Chapman and Hall, 1996, pp. 395\u2013402","DOI":"10.1007\/978-0-387-34897-1_47"},{"key":"593_CR33","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/PL00011429","volume":"90","author":"Lemar\u00e9chal","year":"3","unstructured":"Lemar\u00e9chal, C., Renaud, A.: A geometric study of duality gaps, with applications. Mathematical Programming 90 (3), 399\u2013427 (2001)","journal-title":"Mathematical Programming"},{"key":"593_CR34","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/BF02614390","volume":"76","author":"Lemar\u00e9chal","year":"3","unstructured":"Lemar\u00e9chal, C., Sagastiz\u00e1bal, C.: Variable metric bundle methods: from conceptual to implementable forms. Mathematical Programming 76 (3), 393\u2013410 (1997)","journal-title":"Mathematical Programming"},{"key":"593_CR35","doi-asserted-by":"crossref","first-page":"1022","DOI":"10.1109\/59.871728","volume":"15","author":"Madrigal","year":"3","unstructured":"Madrigal, M., Quintana, V.H.: An interior-point\/cutting-plane method to solve unit commitment problems. IEEE Transactions on Power Systems 15 (3), 1022\u20131027 (2000)","journal-title":"IEEE Transactions on Power Systems"},{"key":"593_CR36","doi-asserted-by":"crossref","first-page":"1195","DOI":"10.1287\/mnsc.22.11.1195","volume":"22","author":"Magnanti","year":"11","unstructured":"Magnanti, T.L., Shapiro, J.F., Wagner, M.H.: Generalized linear programming solves the dual. Management Science 22 (11), 1195\u20131203 (1976)","journal-title":"Management Science"},{"key":"593_CR37","unstructured":"Pellegrino, F., Renaud, A., Socroun, T.: Bundle method and augmented Lagrangian methods for short-term unit commitment. In Proceedings of the 12th PSCC Conference, Dresden 2, 730\u2013739 (1996)"},{"key":"593_CR38","unstructured":"Powell, M.J.D.: A method for nonlinear constraints in minimization problems. In: R. Fletcher (ed.), Optimization. Academic Press, London, New York, 1969"},{"key":"593_CR39","doi-asserted-by":"crossref","first-page":"1080","DOI":"10.1109\/9.231462","volume":"38","author":"Renaud","year":"7","unstructured":"Renaud, A.: Daily generation management at Electricit\u00e9 de France: from planning towards real time. IEEE Transactions on Automatic Control 38 (7), 1080\u20131093 (1993)","journal-title":"IEEE Transactions on Automatic Control"},{"key":"593_CR40","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1007\/BF00934777","volume":"6","author":"Rockafellar","year":"1973","unstructured":"Rockafellar, R.T.: The multiplier method of Hestenes and Powell applied to convex programming. J. Optim. Theory Appl. 6, 555\u2013562 (1973)","journal-title":"J. Optim. Theory Appl."},{"key":"593_CR41","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1137\/0312021","volume":"12","author":"Rockafellar","year":"1974","unstructured":"Rockafellar, R.T.: Augmented Lagrange multiplier functions and duality in nonconvex programming. SIAM J. Cont. 12, 268\u2013285 (1974)","journal-title":"SIAM J. Cont."},{"key":"593_CR42","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1109\/59.317549","volume":"9","author":"Shebl\u00e9","year":"1994","unstructured":"Shebl\u00e9, G.B., Fahd, G.N.: Unit commitment literature synopsis. IEEE Transactions on Power Systems 9, 128\u2013135 (1994)","journal-title":"IEEE Transactions on Power Systems"},{"key":"593_CR43","doi-asserted-by":"crossref","unstructured":"Shor, N.Z.: Minimization methods for non-differentiable functions. Springer Verlag, Berlin, 1985","DOI":"10.1007\/978-3-642-82118-9"},{"key":"593_CR44","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1109\/59.852114","volume":"15","author":"Takriti","year":"1","unstructured":"Takriti, S., Birge, J.R.: Using integer programming to refine lagrangian-based unit commitment solutions. IEEE Transactions on Power Systems 15 (1), 151\u2013156 (2000)","journal-title":"IEEE Transactions on Power Systems"},{"key":"593_CR45","doi-asserted-by":"crossref","unstructured":"Terlaky, T. (ed.): Interior Point Methods of Mathematical Programming. Kluwer Academic Press, Dordrecht, 1996","DOI":"10.1007\/978-1-4613-3449-1"},{"key":"593_CR46","unstructured":"Uzawa, H.: Iterative methods for concave programming. In: K. Arrow, L. Hurwicz, H. Uzawa (eds.), Studies in Linear and Nonlinear Programming. Stanford University Press 1959, pp 154\u2013165"},{"key":"593_CR47","unstructured":"Vanderbeck, F.: A generic view at the Dantzig-Wolfe decomposition approach in mixed integer programming: paving the way for a generic code. Working paper U0222, University of Bordeaux, Talence, France, 2002"},{"key":"593_CR48","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1109\/59.192933","volume":"3","author":"Zhuang","year":"2","unstructured":"Zhuang, F., Galiana, F.D.: Towards a more rigorous and practical unit commitment by lagrangian relaxation. IEEE Transactions on Power Systems 3 (2), 763\u2013773 (1988)","journal-title":"IEEE Transactions on Power Systems"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-005-0593-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-005-0593-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-005-0593-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T05:49:58Z","timestamp":1559108998000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-005-0593-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,4,28]]},"references-count":48,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,9]]}},"alternative-id":["593"],"URL":"https:\/\/doi.org\/10.1007\/s10107-005-0593-4","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,4,28]]}}}