Dual maximization methods for Lagrangian Relaxation-Based SCUC

This paper discusses the analytical and computational challenges of various sub-gradient and cutting plane methods applied to updating Lagrangian multipliers associated with the Security-Constrained Unit Commitment problem. Large-scale testing systems are used to demonstrate the effectiveness of the different algorithms.

[1]  Samuel Henry Fuller.  The analysis and scheduling of devices having rotational delays , 1973, ACM Annual Conference.

[2]  Jack Elzinga,et al.  A central cutting plane algorithm for the convex programming problem , 1975, Math. Program..

[3]  Yurii Nesterov,et al.  New variants of bundle methods , 1995, Math. Program..

[4]  V. Quintana,et al.  An interior-point/cutting-plane method to solve unit commitment problems , 1999, Proceedings of the 21st International Conference on Power Industry Computer Applications. Connecting Utilities. PICA 99. To the Millennium and Beyond (Cat. No.99CH36351).

[5]  Yurii Nesterov,et al.  Homogeneous Analytic Center Cutting Plane Methods with Approximate Centers , 1999 .

[6]  César Beltrán Royo.  Generalized unit commitment by the radar multiplier method , 2001 .

[7]  Jean-Philippe Vial,et al.  Convex nondifferentiable optimization: A survey focused on the analytic center cutting plane method , 2002, Optim. Methods Softw..

[8]  O. Alsaç,et al.  Security Constrained Unit Commitment: Network Modeling and Solution Issues , 2006, 2006 IEEE PES Power Systems Conference and Exposition.

[9]  Claude Tadonki,et al.  Proximal-ACCPM: A Versatile Oracle Based Optimisation Method , 2007 .

[10]  L. Vandenberghe,et al.  Localization and Cutting-Plane Methods , 2007 .

[11]  Congcong Wang,et al.  A subgradient-based cutting plane method to calculate convex hull market prices , 2009, 2009 IEEE Power & Energy Society General Meeting.

[12]  Adam Ouorou,et al.  A proximal cutting plane method using Chebychev center for nonsmooth convex optimization , 2009, Math. Program..