A base reduction method for convex programming (Q917445): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: A feasible direction algorithm for convex optimization: Global convergence rates / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Integrals which are convex functionals. II / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Efficient Computational Procedure for a Generalized Quadratic Programming Problem / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0893-9659(89)90116-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2081669604 / rank | |||
Normal rank | |||
Latest revision as of 11:15, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A base reduction method for convex programming |
scientific article |
Statements
A base reduction method for convex programming (English)
0 references
1989
0 references
inner approximation algorithm
0 references
