scientific article; zbMATH DE number 2047430

zbMATH Open1043.90073MaRDI QIDQ4451575FDOQ4451575

Authors: Yaroslav D. Sergeyev, Dmitri E. Kvasov 

Publication date: 29 February 2004

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

Recommendations

• Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms
• scientific article; zbMATH DE number 2205701
• Introduction to global optimization exploiting space-filling curves
• Novel global optimization algorithm with a space-filling curve and integral function
• Efficient partition of \(N\)-dimensional intervals in the framework of one-point-based algorithms

zbMATH Keywords

non-convex constraintdiagonal algorithmprogram realisation

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Data structures (68P05)

Cited In (3)

• Adaptive method of lines
• Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms
• Efficient partition of \(N\)-dimensional intervals in the framework of one-point-based 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 Q4451575)