A geometric study of duality gaps, with applications

  title={A geometric study of duality gaps, with applications},
  author={Claude Lemar{\'e}chal and Arnaud Renaud},
  journal={Math. Program.},
Lagrangian relaxation is often an efficient tool to solve (large-scale) optimization problems, even nonconvex. However it introduces a duality gap, which should be small for the method to be really efficient. Here we make a geometric study of the duality gap. Given a nonconvex problem, we formulate in a first part a convex problem having the same dual. This formulation involves a convexification in the product of the three spaces containing respectively the variables, the objective and the… CONTINUE READING
Highly Cited
This paper has 82 citations. REVIEW CITATIONS
45 Citations
33 References
Similar Papers


Publications citing this paper.

82 Citations

Citations per Year
Semantic Scholar estimates that this publication has 82 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 33 references

Lagrangean decomposition for integer programming: theory and applications

  • M. Guignard, S. Kim
  • RAIRO Recherche Opérationnelle
  • 1987
Highly Influential
6 Excerpts

An interior-point/cutting-plane method to solve unit commitment problems

  • M. Madrigal, V. H. Quintana
  • IEEE Transact. Power Systems
  • 2000
1 Excerpt

Convex Analysis and Variational Problems

  • I. Ekeland, R. Temam
  • Classics in Applied Mathematics 28
  • 1999
2 Excerpts

Power scheduling in a hydro-thermal system under uncertainty

  • C. C. Caroe, M. P. Nowak, W. Römisch, R. Schultz
  • Proceedings 13th Power Systems Computation…
  • 1999
1 Excerpt

A stochastic model for the unit commitment problem

  • S. Takriti, J. R. Birge, E. Long
  • IEEE Transact. Power Systems
  • 1996
1 Excerpt

Similar Papers

Loading similar papers…