On a primal-proximal heuristic in discrete optimization

DOI10.1007/S10107-004-0571-2MaRDI QIDQ2571002zbMATH OpenOpenAlexFDO

Authors A. Daniilidis, 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-004-0571-2

zbMATH Keywords

French modelLagrangian relaxationPrimal-dual heuristicsproduction of electricityProximal algorithmunit-commitment problem

Mathematics Subject Classification ID

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

Recommendations

• On a discrete optimization problem
• scientific article; zbMATH DE number 1086510
• The primal-dual method for approximation algorithms
• Convex discrete optimization
• scientific article; zbMATH DE number 617944
• scientific article; zbMATH DE number 165547
• A primal heuristic for nonsmooth mixed integer nonlinear optimization
• scientific article; zbMATH DE number 3936928
• scientific article; zbMATH DE number 2159405
• Su un problema di minimax discreto

Cites work

• A geometric study of dual gaps, with applications
• A primal-proximal heuristic applied to the French unit-commitment problem
• Convexification procedures and decomposition methods for nonconvex optimization problems
• Dual Applications of Proximal Bundle Methods, Including Lagrangian Relaxation of Nonconvex Problems
• Generalized Linear Programming Solves the Dual
• scientific article; zbMATH DE number 1667417 (Why is no real title available?)
• scientific article; zbMATH DE number 3614502 (Why is no real title available?)
• scientific article; zbMATH DE number 1070385 (Why is no real title available?)
• scientific article; zbMATH DE number 2084780 (Why is no real title available?)
• Lagrange Multipliers and Nonconvex Programs
• Optimal short-term scheduling of large-scale power systems
• The Theory of Max-Min, with Applications

Cited in

(12)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2571002)