Piyavskij's method for solving the general global optimization problem
type: Item
instance of: scholarly article
title: Piyavskij's method for solving the general global optimization problem
zbMATH Open document ID: 0777.90080
author: Vladimir I. Norkin
published in: Computational Mathematics and Mathematical Physics
publication date: 1993-09-06T00:00:00Z
review text: The general global optimization problem with nonlinear constraints (equalities and inequalities) is considered. The author proposes a method of sequential approximation of such a problem by multiextremal problems of special form. The approximated problems are reduced then to concave or dual concave programming problems. Several algorithms for solving auxiliary subproblems are proposed.
Mathematics Subject Classification ID: 90C48
zbMATH DE Number: 205004
zbMATH Keywords: nonconvex approximations
zbMATH Keywords: global optimization
zbMATH Keywords: nonlinear constraints
zbMATH Keywords: sequential approximation
zbMATH Keywords: dual concave programming
reviewed by: Nada Djuranović-Miličić
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 205004