scientific article

zbMath0569.90077MaRDI QIDQ3686446

Hoang Tuy, Nguyen van Thuong

Publication date: 1985

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

zbMATH Keywords

convex functionglobal minimumreverse convex constraintcomplement of a convex setsequence of convex maximization subproblems over polytopes

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Related Items

On solving general reverse convex programming problems by a sequence of linear programs and line searches, Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems, The design centering problem as a d.c. programming problem, On the global minimization of a convex function under general nonconvex constraints, Mathematical programs with a two-dimensional reverse convex constraint, Calculation of bounds on variables satisfying nonlinear inequality constraints, Convex minimization under Lipschitz constraints, Quasiconjugates of functions, duality relationship between quasiconvex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint, and applications, A generalized Dantzig-Wolfe decomposition principle for a class of nonconvex programming problems