Two alternatives for the cubic algorithm (Q1095036): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The cubic algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A linear algorithm for determining the separation of convex polyhedra / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0022-247x(87)90088-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1994631618 / rank | |||
Normal rank | |||
Latest revision as of 10:16, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two alternatives for the cubic algorithm |
scientific article |
Statements
Two alternatives for the cubic algorithm (English)
0 references
1987
0 references
Two alternatives are proved that allow application of the cubic algorithm for finding approximate solutions of the general non-convex and non- robust mathematical programming problem.
0 references
cubic algorithm
0 references
approximate solutions
0 references
non-convex
0 references
non-robust
0 references
