Two alternatives for the cubic algorithm (Q1095036): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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 | |||
Revision as of 12:26, 18 June 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
