Convergence of duality bound method in partly convex programming

Authors: Nguyen Van Thoai

Source: Journal of Global Optimization. 22:263-270

Subject Terms: Decomposition branch and bound algorithms, Partly convex programming problems, Polyhedral combinatorics, branch-and-bound, branch-and-cut, 0211 other engineering and technologies, 02 engineering and technology, Optimality conditions and duality in mathematical programming, Nonconvex programming, global optimization, Lagrangian duality

File Description: application/xml

Access URL: https://zbmath.org/2088645
https://doi.org/10.1023/a:1013871532570
https://dblp.uni-trier.de/db/journals/jgo/jgo22.html#Thoai02
https://link.springer.com/article/10.1023%2FA%3A1013871532570