An implicit space covering method with applications to fixed point and global optimization problems

zbMath0668.90063MaRDI QIDQ1118532

Hoang Tuy

Publication date: 1987

Published in: Acta Mathematica Vietnamica (Search for Journal in Brave)

zbMATH Keywords

covering method

Mathematics Subject Classification ID

90C25: Convex programming

52C17: Packing and covering in (n) dimensions (aspects of discrete geometry)

52A20: Convex sets in (n) dimensions (including convex hypersurfaces)

90C55: Methods of successive quadratic programming type

Related Items

Convex multilevel decomposition algorithms for non‐monotone problems