Variational analysis of an extended eigenvalue problem (Q1893098): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3324260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4000274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Stationary Values of a Second-Degree Polynomial on the Unit Sphere / rank
 
Normal rank
Property / cites work
 
Property / cites work: Least squares with a quadratic constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constrained eigenvalue problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Modified Matrix Eigenvalue Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratically constrained least squares and quadratic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a Trust Region Step / rank
 
Normal rank
Property / cites work
 
Property / cites work: Newton’s Method with a Model Trust Region Modification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trust Region Problems and Nonsymmetric Eigenvalue Perturbations / rank
 
Normal rank

Latest revision as of 14:07, 23 May 2024

scientific article
Language Label Description Also known as
English
Variational analysis of an extended eigenvalue problem
scientific article

    Statements

    Variational analysis of an extended eigenvalue problem (English)
    0 references
    0 references
    7 November 1995
    0 references
    This paper considers for a symmetric matrix \(B\) the problem: maximize \(\mu_ a : = x^ tBx - 2a^ tx\) subject to \(x^ tx = 1\). For the solution it is necessary to computers the Lagrange multiplier \(\lambda (a)\) as extended eigenvalue \(\lambda (a) = \max \{\lambda \mid (B - \lambda I)x = a\); \(x^ tx = 1\}\) of the pair \(\{B,a\}\). Nonsmooth analysis is required to discuss the function \(\lambda(a)\) in order to derive a multiplier result on the sensitivity near 0. The authors prove continuous differentiability on a large set of points and that \(\lambda (\cdot)\) is Lipschitz near 0 and regular at 0. They characterize the generalized gradient and directional derivatives at 0.
    0 references
    mathematical programming
    0 references
    extended eigenvalue problem
    0 references
    quadratic problem
    0 references
    nonsmooth analysis
    0 references
    symmetric matrix
    0 references
    Lagrange multiplier
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references