Local programming.
type: Item
instance of: scholarly article
title: Local programming.
zbMATH Open document ID: 1040.90048
published in: Computational Mathematics and Mathematical Physics
publication date: 2003-06-29T00:00:00Z
review text: The paper deals with local programming problems with the additional constraint \(\| x-a\| \leq\varepsilon\). It turns out that if \(a\) is a regular point of the original problem and \({\varepsilon}>0\) is sufficiently small, these problems behave as convex ones, even though neither the objective function nor the constraints are assumed to be convex. The duality theory for local programming problems is developed.
Mathematics Subject Classification ID: 90C48
Mathematics Subject Classification ID: 49J27
Mathematics Subject Classification ID: 49J53
zbMATH DE Number: 1940602
zbMATH Keywords: local programming
zbMATH Keywords: constraints
zbMATH Keywords: regular point
zbMATH Keywords: convex set
zbMATH Keywords: convergence
zbMATH Keywords: duality
author: Boris T. Polyak
reviewed by: A. Tret'yakov
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 1940602