Publication:3974977
From MaRDI portal
zbMath0813.90115MaRDI QIDQ3974977
Publication date: 26 June 1992
linear complementarity problem; branch-and-bound; difference of two convex functions; reverse convex constraint; dc-programming; geometric complementarity
90C25: Convex programming
49M37: Numerical methods based on nonlinear programming
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
Related Items
Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms, The complementary convex structure in global optimization, Polyhedral annexation, dualization and dimension reduction technique in global optimization