On the characterization of \(Q\)-superlinear convergence of quasi-Newton interior-point methods for nonlinear programming (Q1908583): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import240304020342 (talk | contribs)
Set profile property.
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Héctor Martínez / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Q587133 / rank
Normal rank
 
Property / author
 
Property / author: Héctor Martínez / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Otu Vaarmann / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:13, 5 March 2024

scientific article
Language Label Description Also known as
English
On the characterization of \(Q\)-superlinear convergence of quasi-Newton interior-point methods for nonlinear programming
scientific article

    Statements

    On the characterization of \(Q\)-superlinear convergence of quasi-Newton interior-point methods for nonlinear programming (English)
    0 references
    0 references
    0 references
    0 references
    8 December 1996
    0 references
    It is admitted that the primal-dual Newton interior-point method can be considered as a damped and perturbed Newton method applied to the Karush-Kuhn-Tucker (KKT) necessary conditions. The KKT conditions involve the vector of primal variables \(x\), the vector of dual variables \(y\) corresponding to equality constraints and the vector of dual variables \(z\) corresponding to the nonnegative constraints on the primal variables \(x\). Introducing some assumptions on the interaction between the primal variable \(x\) and the dual variable \(z\) the authors extend the Boggs-Tolle-Wang characterization of \(Q\)-superlinear convergence for quasi-Newton methods for equality constrained optimization to quasi-Newton interior-point methods for general nonlinear programming in terms of the variables \((x, z)\) alone. Besides the determination of the primary variables, other principal problems such as the choice of the centering parameter and the choice of the steplength parameter are discussed.
    0 references
    Karush-Kuhn-Tucker conditions
    0 references
    primal-dual Newton interior-point method
    0 references
    \(Q\)-superlinear convergence
    0 references
    quasi-Newton methods
    0 references
    nonlinear programming
    0 references
    0 references

    Identifiers