caa a22 4500 469067780 CHVBK 20180323132913.0 cr unu---uuuuu 170328e19920301xx s 000 0 eng 10.1007/BF00121300 doi (NATIONALLICENCE)springer-10.1007/BF00121300 Tuy Hoang Institute of Mathematics, Hanoi aut The complementary convex structure in global optimization [Elektronische Daten] [Hoang Tuy] We show the importance of exploiting the complementary convex structure for efficiently solving a wide class of specially structured nonconvex global optimization problems. Roughly speaking, a specific feature of these problems is that their nonconvex nucleus can be transformed into a complementary convex structure which can then be shifted to a subspace of much lower dimension than the original underlying space. This approach leads to quite efficient algorithms for many problems of practical interest, including linear and convex multiplicative programming problems, concave minimization problems with few nonlinear variables, bilevel linear optimization problems, etc... Kluwer Academic Publishers, 1992 Complementary convex structure nationallicence Generalized Rank k Property nationallicence global optimization nationallicence Journal of Global Optimization Kluwer Academic Publishers 2/1(1992-03-01), 21-40 0925-5001 2:1<21 1992 2 10898 https://doi.org/10.1007/BF00121300 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/BF00121300 text/html Onlinezugriff via DOI NATIONALLICENCE 100 1- Tuy Hoang Institute of Mathematics, Hanoi aut NATIONALLICENCE 773 0- Journal of Global Optimization Kluwer Academic Publishers 2/1(1992-03-01), 21-40 0925-5001 2:1<21 1992 2 10898 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer