scientific article; zbMATH DE number 17649

zbMATH Open0813.90115MaRDI QIDQ3974977FDOQ3974977

Authors: Hoang Tuy, Reiner Horst 

Publication date: 26 June 1992

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

Recommendations

• scientific article; zbMATH DE number 910792
• scientific article; zbMATH DE number 4131966
• scientific article; zbMATH DE number 3910151
• The complementary convex structure in global optimization
• scientific article; zbMATH DE number 1076336

zbMATH Keywords

linear complementarity problembranch-and-bounddifference of two convex functionsreverse convex constraintdc-programminggeometric complementarity

Mathematics Subject Classification ID

Convex programming (90C25) Numerical methods based on nonlinear programming (49M37) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cited In (4)

• The complementary convex structure in global optimization
• Polyhedral annexation, dualization and dimension reduction technique in global optimization
• Title not available (Why is that?)
• Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms

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 Q3974977)