A sequential convexification method (SCM) for continuous global optimization
From MaRDI portal
Publication:1422879
DOI10.1023/A:1023031513471zbMath1049.90069MaRDI QIDQ1422879
Publication date: 12 February 2004
Published in: Journal of Global Optimization (Search for Journal in Brave)
Abstract computational complexity for mathematical programming problems (90C60) Nonconvex programming, global optimization (90C26)
Related Items (5)
Global descent method for constrained continuous global optimization ⋮ A review of recent advances in global optimization ⋮ MEEF: A minimum-elimination-escape function method for multimodal optimization problems ⋮ A new constructing auxiliary function method for global optimization ⋮ A new filled function for unconstrained global optimization
This page was built for publication: A sequential convexification method (SCM) for continuous global optimization