scientific article; zbMATH DE number 2205687

MaRDI QIDQ5317003zbMATH OpenFDO

Authors K. A. Barkalov, Roman G. Strongin

Publication date 15 September 2005

zbMATH Keywords

adaptive order of checkingchecking for constraintsglobal optimization technique

Mathematics Subject Classification ID

Existence of solutions for minimax problems (49J35)

Recommendations

• Global optimization with non-convex constraints. Sequential and parallel algorithms
• Adaptive memory programming for constrained global optimization
• scientific article; zbMATH DE number 3930752
• Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints
• An adaptive constraint handling technique for evolutionary algorithms

Cited in

(6)

• Solving a set of global optimization problems by the parallel technique with uniform convergence
• Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints
• Adaptive memory programming for constrained global optimization
• An improved self-adaptive constraint sequencing approach for constrained optimization problems
• Parallel global optimization on GPU
• A Search Algorithm for the Global Extremum of a Discontinuous Function

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 Q5317003)