New Partitioning Method for a Class of Nonconvex Optimization Problems

DOI10.1287/MOOR.17.1.43MaRDI QIDQ4016709zbMATH OpenOpenAlexFDO

Authors 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

d.c. programsglobal optimizationnonconvex decompositionnonconvex optimizationpartitioning method

Mathematics Subject Classification ID

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

Recommendations

• On nonconvex optimization problems with separated nonconvex variables
• Convergence and application of a decomposition method using duality bounds for nonconvex global optimization
• scientific article; zbMATH DE number 4145673
• An Algorithm for Separable Nonconvex Programming Problems
• Convexification and decomposition of separable nonconvex optimization problems

Cited in

(6)

• On nonconvex optimization problems with separated nonconvex variables
• Lagrange duality and partitioning techniques in nonconvex global optimization
• A new successive partition algorithm for concave minimization based on cone decomposition and decomposition cuts
• scientific article; zbMATH DE number 4135727 (Why is no real title available?)
• scientific article; zbMATH DE number 4145166 (Why is no real title available?)
• Partition-Optimization with Schur Convex Sum Objective Functions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4016709)