scientific article; zbMATH DE number 3910151

zbMATH Open0569.90077MaRDI QIDQ3686446FDOQ3686446

Authors: Hoang Tuy, Nguyen van Thuong 

Publication date: 1985

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 3993310
• scientific article; zbMATH DE number 124014
• Convex programs with an additional reverse convex constraint
• On the global minimization of a convex function under general nonconvex constraints
• scientific article; zbMATH DE number 4131966

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)

Cited In (21)

• Mathematical programs with a two-dimensional reverse convex constraint
• The smallest convex extensions of a convex function
• Quasiconjugates of functions, duality relationship between quasiconvex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint, and applications
• Title not available (Why is that?)
• Convex programming for disjunctive convex optimization
• Minimisation de fonctionnelles dans un ensemble de fonctions convexes
• Title not available (Why is that?)
• Calculation of bounds on variables satisfying nonlinear inequality constraints
• Convex minimization under Lipschitz constraints
• Minimizing the sum of a convex function and the product of two affine functions over a convex set
• On the global minimization of a convex function under general nonconvex constraints
• An active method of searching for the global minimum of a concave function
• Title not available (Why is that?)
• A generalized Dantzig-Wolfe decomposition principle for a class of nonconvex programming problems
• Convex minization over \(\mathbb Z^2\)
• The design centering problem as a d.c. programming problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
• Minimizing a convex combination of the overshoot and undershoot
• On solving general reverse convex programming problems by a sequence of linear programs and line searches

This page was built for publication:

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