A base reduction method for convex programming (Q917445): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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 | |||
Revision as of 09:03, 21 June 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
