New Partitioning Method for a Class of Nonconvex Optimization Problems

DOI10.1287/moor.17.1.43zbMath0773.90057OpenAlexW2103509450MaRDI QIDQ4016709

Phan Thien Thach

Publication date: 16 January 1993

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.17.1.43

zbMATH Keywords

global optimizationnonconvex optimizationpartitioning methodd.c. programsnonconvex decomposition

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

This page was built for publication: New Partitioning Method for a Class of Nonconvex Optimization Problems