scientific article; zbMATH DE number 2190135

zbMath1105.90066MaRDI QIDQ5462195

Hoang Tuy

Publication date: 1 August 2005

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

approximate optimal solutionmonotonic optimizationessential optimal solutionsuccessive incumbent transcending algorithmpolynomial global optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Sensitivity, stability, well-posedness (49K40) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31)

Related Items (6)

A robust algorithm for quadratic optimization under quadratic constraints ⋮ Branch-reduction-bound algorithm for generalized geometric programming ⋮ A robust algorithm for generalized geometric programming ⋮ Global optimization for the generalized polynomial sum of ratios problem ⋮ \({{\mathcal {D}(\mathcal {C})}}\)-optimization and robust global optimization ⋮ Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints

This page was built for publication: