Extremal problems with d.c.-contraints. (Q1395156): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Alexander S. Strekalovsky / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Alexey A. Tret'yakov / rank | |||
Normal rank | |||
Revision as of 21:31, 13 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Extremal problems with d.c.-contraints. |
scientific article |
Statements
Extremal problems with d.c.-contraints. (English)
0 references
29 June 2003
0 references
The paper is centred on nonconvex mathematical programming problems in which one of the inequality constraints is given by a difference of two convex functions (i.e., by a d.c.-function). Necessary and sufficient conditions for a global solution are obtained. In addition, these conditions possess the so-called algorithmic property, which allows the construction of computational method for finding a global solution in problems with d.c.-constraints.
0 references
nonconvex mathematical programming problem
0 references
d.c.-function
0 references
necessary and sufficient conditions
0 references
global optimum
0 references
constraints
0 references
