Methods of multiextremal optimization under constraints for separably quasimonotone functions
type: Item
instance of: scholarly article
title: Methods of multiextremal optimization under constraints for separably quasimonotone functions
zbMATH Open document ID: 1270.49029
DOI: 10.1134/S1064230711020134
author: Yu. A. Zak
published in: Journal of Computer and Systems Sciences International
publication date: 2013-08-13T00:00:00Z
Mathematics Subject Classification ID: 49M30
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6198168
zbMATH Keywords: separably quasimonotone functions
zbMATH Keywords: multiextremal optimization
zbMATH Keywords: nonconvex constraints
zbMATH Keywords: branch-and-bound method
MaRDI profile type: Publication
cites work: An Algorithm for the Traveling Salesman Problem
cites work: Branch and bound algorithm for computing the minimum stability degree of parameter‐dependent linear systems
cites work: Global optimization to prescribed accuracy
cites work: Q4258228
cites work: Q4692508
cites work: Q3340546
cites work: Global optimization with non-convex constraints. Sequential and parallel algorithms
description: scientific article; zbMATH DE number 6198168