A primal-proximal heuristic applied to the French unit-commitment problem

DOI10.1007/S10107-005-0593-4zbMath1077.90083OpenAlexW2078380471MaRDI QIDQ2571007

R. Gonzalez, L. Dubost, Claude Lemaréchal

Publication date: 31 October 2005

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-005-0593-4

zbMATH Keywords

Lagrangian relaxationCombinatorial optimizationFrench modelPrimal-dual heuristicsproduction of electricityProximal algorithmUnit-commitment problem

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Applications of mathematical programming (90C90) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (23)

Decomposition algorithm for large-scale two-stage unit-commitment ⋮ Prices stabilization for inexact unit-commitment problems ⋮ Probabilistic optimization via approximate \(p\)-efficient points and bundle methods ⋮ A comparison of four approaches from stochastic programming for large-scale unit-commitment ⋮ Tighter MIP formulations for the discretised unit commitment problem with MIN-stop ramping constraints ⋮ Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints ⋮ Incremental Bundle Methods using Upper Models ⋮ Solving the electricity production planning problem by a column generation based heuristic ⋮ Asynchronous level bundle methods ⋮ Latest Improvements of EDF Mid-term Power Generation Management ⋮ Solving the short-term scheduling problem of hydrothermal systems via Lagrangian relaxation and augmented Lagrangian ⋮ Large-scale unit commitment under uncertainty: an updated literature survey ⋮ On the complexity of the unit commitment problem ⋮ Decomposition approaches for block-structured chance-constrained programs with application to hydro-thermal unit commitment ⋮ Outer-approximation algorithms for nonsmooth convex MINLP problems ⋮ Divide to conquer: decomposition methods for energy optimization ⋮ A strongly convergent proximal bundle method for convex minimization in Hilbert spaces ⋮ Decomposition and shortest path problem formulation for solving the hydro unit commitment and scheduling in a hydro valley ⋮ Regularized decomposition of large scale block-structured robust optimization problems ⋮ Two ``well-known properties of subgradient optimization ⋮ On a primal-proximal heuristic in discrete optimization ⋮ Large-scale unit commitment under uncertainty ⋮ Joint chance constrained programming for hydro reservoir management

Uses Software

• PLCP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Auxiliary problem principle and decomposition of optimization problems
• Newton's method for convex programming and Tschebyscheff approximation
• Convexification procedures and decomposition methods for nonconvex optimization problems
• A Cholesky dual method for proximal piecewise linear programming
• Interior point methods of mathematical programming
• Variable metric bundle methods: From conceptual to implementable forms
• Unit commitment in power generation -- a basic model and some extensions
• Ergodic, primal convergence in dual subgradient schemes for convex programming
• Multiplier and gradient methods
• The multiplier method of Hestenes and Powell applied to convex programming
• On a primal-proximal heuristic in discrete optimization
• The Cutting-Plane Method for Solving Convex Programs
• Optimal short-term scheduling of large-scale power systems
• Lagrangean decomposition: A model yielding stronger lagrangean bounds
• Lagrangean decomposition for integer programming : theory and applications
• A Dual Method for Certain Positive Semidefinite Quadratic Programming Problems
• Generalized Linear Programming Solves the Dual
• Dual Applications of Proximal Bundle Methods, Including Lagrangian Relaxation of Nonconvex Problems
• Lagrange Multipliers and Nonconvex Programs
• Primal Resource-Directive Approaches for Optimizing Nonlinear Decomposable Systems
• The omnipresence of Lagrange
• A geometric study of dual gaps, with applications

This page was built for publication: A primal-proximal heuristic applied to the French unit-commitment problem