A primal-proximal heuristic applied to the French unit-commitment problem
DOI10.1007/S10107-005-0593-4zbMATH Open1077.90083OpenAlexW2078380471MaRDI QIDQ2571007FDOQ2571007
R. González, Claude Lemaréchal, L. Dubost
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
Lagrangian relaxationCombinatorial optimizationFrench modelPrimal-dual heuristicsproduction of electricityProximal algorithmUnit-commitment problem
Large-scale problems in mathematical programming (90C06) Approximation methods and heuristics in mathematical programming (90C59) Applications of mathematical programming (90C90)
Cites Work
- Title not available (Why is that?)
- Multiplier and gradient methods
- Title not available (Why is that?)
- Ergodic, primal convergence in dual subgradient schemes for convex programming
- The multiplier method of Hestenes and Powell applied to convex programming
- Auxiliary problem principle and decomposition of optimization problems
- Variable metric bundle methods: From conceptual to implementable forms
- 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
- Title not available (Why is that?)
- The omnipresence of Lagrange
- Unit commitment in power generation -- a basic model and some extensions
- Title not available (Why is that?)
- Dual Applications of Proximal Bundle Methods, Including Lagrangian Relaxation of Nonconvex Problems
- Lagrange Multipliers and Nonconvex Programs
- A geometric study of dual gaps, with applications
- Newton's method for convex programming and Tschebyscheff approximation
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Cholesky dual method for proximal piecewise linear programming
- Title not available (Why is that?)
- Generalized Linear Programming Solves the Dual
- Lagrangean decomposition for integer programming : theory and applications
- A Dual Method for Certain Positive Semidefinite Quadratic Programming Problems
- Primal Resource-Directive Approaches for Optimizing Nonlinear Decomposable Systems
- Convexification procedures and decomposition methods for nonconvex optimization problems
- Interior point methods of mathematical programming
Cited In (24)
- Large-scale unit commitment under uncertainty: an updated literature survey
- Prices stabilization for inexact unit-commitment problems
- Regularized decomposition of large scale block-structured robust optimization problems
- Outer-approximation algorithms for nonsmooth convex MINLP problems
- Decomposition approaches for block-structured chance-constrained programs with application to hydro-thermal unit commitment
- Decomposition algorithm for large-scale two-stage unit-commitment
- Divide to conquer: decomposition methods for energy optimization
- A comparison of four approaches from stochastic programming for large-scale unit-commitment
- 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
- Bundle relaxation and primal recovery in unit commitment problems. The Brazilian case
- Large-scale unit commitment under uncertainty
- On a primal-proximal heuristic in discrete optimization
- Joint chance constrained programming for hydro reservoir management
- Latest Improvements of EDF Mid-term Power Generation Management
- Probabilistic optimization via approximate \(p\)-efficient points and bundle methods
- Incremental Bundle Methods using Upper Models
- Tighter MIP formulations for the discretised unit commitment problem with MIN-stop ramping constraints
- Solving the short-term scheduling problem of hydrothermal systems via Lagrangian relaxation and augmented Lagrangian
- On the complexity of the unit commitment problem
- Asynchronous level bundle methods
- Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints
- Two ``well-known properties of subgradient optimization
- Solving the electricity production planning problem by a column generation based heuristic
Uses Software
Recommendations
This page was built for publication: A primal-proximal heuristic applied to the French unit-commitment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2571007)
