Convergence of a Tuy-type algorithm for concave minimization subject to linear inequality constraints (Q1148807): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Successive Underestimation Method for Concave Minimization Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Global Maximization of a Convex Function with Linear Inequality Constraints / rank | |||
Normal rank | |||
Latest revision as of 10:23, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Convergence of a Tuy-type algorithm for concave minimization subject to linear inequality constraints |
scientific article |
Statements
Convergence of a Tuy-type algorithm for concave minimization subject to linear inequality constraints (English)
0 references
1981
0 references
convergence
0 references
concave minimization
0 references
linear inequality constraints
0 references
Tuy's cone splitting algorithm
0 references
convex polytopes
0 references
nonconvex programming
0 references
0 references
