Asymptotic analysis of a path-following barrier method for linearly constrained convex problems<sup>*</sup> (Q4265517): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3998344 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Global inexact Newton methods for very large scale nonlinear problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Asymptotic Mesh Independence of Newton–Galerkin Methods via a Refined Mysovskii Theorem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4171860 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4296156 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A sufficient condition for self-concordance, with application to some classes of structured convex programming problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On some efficient interior point methods for nonlinear convex programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4339096 / rank | |||
Normal rank |
Latest revision as of 22:45, 28 May 2024
scientific article; zbMATH DE number 1339709
Language | Label | Description | Also known as |
---|---|---|---|
English | Asymptotic analysis of a path-following barrier method for linearly constrained convex problems<sup>*</sup> |
scientific article; zbMATH DE number 1339709 |
Statements
Asymptotic analysis of a path-following barrier method for linearly constrained convex problems<sup>*</sup> (English)
0 references
22 September 1999
0 references
convex programming
0 references
interior-point method
0 references
constraint optimization
0 references
asymptotic convergence analysis
0 references
logarithmic barrier method
0 references
path-following algorithm
0 references
Newton's method
0 references
0 references