Convergence of duality bound method in partly convex programming

Συγγραφείς: Nguyen Van Thoai

Πηγή: Journal of Global Optimization. 22:263-270

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: 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

Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions

Συγγραφείς: Thai Quynh Phong, Le Dung Muu, Pham Dinh Tao

Πηγή: Computational Optimization and Applications. 4:203-216

Θεματικοί όροι: convergent decomposition branch-and-bound algorithms, Mixed integer programming, 0211 other engineering and technologies, adaptive bisection, bilinear programming, 02 engineering and technology, Quadratic programming, Nonconvex programming, global optimization

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/765201
https://doi.org/10.1007/bf01300871
https://rd.springer.com/article/10.1007/BF01300871
https://link.springer.com/article/10.1007%2FBF01300871
https://dblp.uni-trier.de/db/journals/coap/coap4.html#MuuPT95