A primal-proximal heuristic applied to the French Unit-commitment problem
- 28 April 2005
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 104 (1) , 129-151
Abstract
No abstract availableKeywords
This publication has 38 references indexed in Scilit:
- On a primal-proximal heuristic in discrete optimizationMathematical Programming, 2005
- The omnipresence of Lagrange4OR, 2003
- An interior-point/cutting-plane method to solve unit commitment problemsIEEE Transactions on Power Systems, 2000
- Ergodic, primal convergence in dual subgradient schemes for convex programmingMathematical Programming, 1999
- Daily generation management at Electricite de France: from planning towards real timeIEEE Transactions on Automatic Control, 1993
- Daily generation scheduling optimization with transmission constraints: a new class of algorithmsIEEE Transactions on Power Systems, 1992
- Iterative methods for concave programming1989
- Optimal short-term scheduling of large-scale power systemsIEEE Transactions on Automatic Control, 1983
- Numerical Inversion of the Laplace TransformMathematics of Computation, 1968
- Newton's method for convex programming and Tchebycheff approximationNumerische Mathematik, 1959