Asymptotic analysis of a path-following barrier method for linearly constrained convex problems<sup>*</sup> (Q4265517): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q986936
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Christian Grossmann / 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.1080/02331939908844427 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1977555488 / rank
 
Normal rank
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
    0 references
    22 September 1999
    0 references
    0 references
    0 references
    0 references
    0 references
    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