An implicit space covering method with applications to fixed point and global optimization problems
From MaRDI portal
Publication:1118532
zbMath0668.90063MaRDI QIDQ1118532
Publication date: 1987
Published in: Acta Mathematica Vietnamica (Search for Journal in Brave)
Convex programming (90C25) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Methods of successive quadratic programming type (90C55)
Related Items (1)
This page was built for publication: An implicit space covering method with applications to fixed point and global optimization problems
