Minimum distance to the complement of a convex set: Duality result (Q1379954): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q297124 |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Walter Briec / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some NP-complete problems in quadratic and nonlinear programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Role of copositivity in optimality criteria for nonconvex optimization problems / rank | |||
Normal rank | |||
Latest revision as of 10:25, 28 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum distance to the complement of a convex set: Duality result |
scientific article |
Statements
Minimum distance to the complement of a convex set: Duality result (English)
0 references
5 March 1998
0 references
separation theorem
0 references
minimum distance to the complement of a convex set
0 references
duality theorem
0 references
