Two properties of condition numbers for convex programs via implicitly defined barrier functions (Q1849258): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Javier F. Peña / rank | |||
Property / reviewed by | |||
Property / reviewed by: Reginald P. Tewarson / rank | |||
Property / author | |||
Property / author: Javier F. Peña / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Reginald P. Tewarson / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s101070200294 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1998953328 / rank | |||
Normal rank |
Latest revision as of 02:21, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Two properties of condition numbers for convex programs via implicitly defined barrier functions |
scientific article |
Statements
Two properties of condition numbers for convex programs via implicitly defined barrier functions (English)
0 references
1 December 2002
0 references
The potential explosive growth of the condition numbers of the linear equations arising in interior-point methods is discussed. Two types of estimates on the growth of these condition numbers along the central path have been previously developed. In this paper, two bounds for such estimates are derived and stated in fundamentally different ways and shown to be compatible. Conic systems and their distance to infeasibility is discussed. A generalization of an earlier algorithm is given. The implicitly defined function approach enables a succinct consolidation of several results regarding self-concordant functions, the central path of a convex program, and conic systems and their distance to infeasibility.
0 references
convex programs
0 references
condition numbers
0 references
interior-point methods
0 references
algorithm
0 references
distance to infeasibility
0 references