On a primal-proximal heuristic in discrete optimization

DOI10.1007/s10107-004-0571-2zbMath1077.90082OpenAlexW2081098040MaRDI QIDQ2571002

Claude Lemaréchal, Aris Daniilidis

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-004-0571-2

zbMATH Keywords

Lagrangian relaxationunit-commitment problemFrench modelPrimal-dual heuristicsproduction of electricityProximal algorithm

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (10)

Decomposition algorithm for large-scale two-stage unit-commitment ⋮ A comparison of four approaches from stochastic programming for large-scale unit-commitment ⋮ Large-scale unit commitment under uncertainty: an updated literature survey ⋮ Proximity search for 0--1 mixed-integer convex programming ⋮ Divide to conquer: decomposition methods for energy optimization ⋮ Progressive decoupling of linkages in optimization and variational inequalities with elicitable convexity or monotonicity ⋮ Decomposition and shortest path problem formulation for solving the hydro unit commitment and scheduling in a hydro valley ⋮ A primal-proximal heuristic applied to the French unit-commitment problem ⋮ Large-scale unit commitment under uncertainty ⋮ Towards an objective feasibility pump for convex minlps

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convexification procedures and decomposition methods for nonconvex optimization problems
• A primal-proximal heuristic applied to the French unit-commitment problem
• Optimal short-term scheduling of large-scale power systems
• Generalized Linear Programming Solves the Dual
• Dual Applications of Proximal Bundle Methods, Including Lagrangian Relaxation of Nonconvex Problems
• The Theory of Max-Min, with Applications
• Lagrange Multipliers and Nonconvex Programs
• A geometric study of dual gaps, with applications

This page was built for publication: On a primal-proximal heuristic in discrete optimization