V. V. Voloshinov, E. S. Levitin, “Approximate search for a global minimum in problems of mathematical programming that are close to convex”, Zh. Vychisl. Mat. Mat. Fiz., 1999, Volume 39, Number 3,Pages <nobr>386

JOURNALS // Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki // Archive

Zh. Vychisl. Mat. Mat. Fiz., 1999 Volume 39, Number 3, Pages 386–417 (Mi zvmmf1714)

This article is cited in 2 papers

Approximate search for a global minimum in problems of mathematical programming that are close to convex

V. V. Voloshinov, E. S. Levitin

Institute of Systems Analysis, Russian Academy of Sciences

UDC: 519.658:519.853

MSC: Primary 90C26; Secondary 90C59, 65K05

Received: 08.06.1998

English version: Computational Mathematics and Mathematical Physics, 1999, 39:3, 365–396

Bibliographic databases: