An infeasible interior proximal method for convex programming problems with linear constraints (Q2764699)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An infeasible interior proximal method for convex programming problems with linear constraints |
scientific article; zbMATH DE number 1690868
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An infeasible interior proximal method for convex programming problems with linear constraints |
scientific article; zbMATH DE number 1690868 |
Statements
14 January 2002
0 references
infeasible interior proximal method
0 references
convex programming problem
0 references
0 references
0.94360185
0 references
0.94334173
0 references
0.9423122
0 references
0.93560547
0 references
0.93123525
0 references
0.9278369
0 references
0 references
An infeasible interior proximal method for convex programming problems with linear constraints (English)
0 references
