Details

Autor(en) / Beteiligte

• Nguyen Van Thoai

Titel

Convergence of duality bound method in partly convex programming

Ist Teil von

• Journal of global optimization, 2002-01, Vol.22 (1-4), p.263

Ort / Verlag

Dordrecht: Springer Nature B.V

Erscheinungsjahr

2002

Quelle

SpringerLINK Contemporary (Konsortium Baden-Württemberg)

Beschreibungen/Notizen

• We discuss the convergence of a decomposition branch-and-bound algorithm using Lagrangian duality for partly convex programs in the general form. It is shown that this decomposition algorithm has all convergence properties as any known branch-and-bound algorithm in global optimization under usual assumptions. Thus, some strict assumptions discussed in the literature are avoidable.