Local programming. (Q1395207)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1940602
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Local programming. |
scientific article; zbMATH DE number 1940602 |
Statements
Local programming. (English)
0 references
29 June 2003
0 references
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.
0 references
local programming
0 references
constraints
0 references
regular point
0 references
convex set
0 references
convergence
0 references
duality
0 references
0.762321412563324
0 references
0.746324360370636
0 references
0.7441875338554382
0 references
