A sensitivity result for semidefinite programs. (Q1417590): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4503250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On parametric semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditioning of semidefinite programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4517098 / rank
 
Normal rank
Property / cites work
 
Property / cites work: First Order Conditions for General Nonlinear Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized equations and their solutions, part II: Applications to nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: First and second order analysis of nonlinear semidefinite programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Eigenvalue Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4517099 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sensitivity of central solutions in semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensitivity analysis in linear programming and semidefinite programming using interior-point methods / rank
 
Normal rank

Latest revision as of 12:33, 6 June 2024

scientific article
Language Label Description Also known as
English
A sensitivity result for semidefinite programs.
scientific article

    Statements

    A sensitivity result for semidefinite programs. (English)
    0 references
    0 references
    0 references
    5 January 2004
    0 references
    The authors consider the perturbation of solutions of linear semidefinite problems subjected to small changes of the data. A self-contained proof of the differentiability of unique and strictly complementary solutions is given. Furthermore a new characterization of the derivatives of the solution map as solutions of a nonsingular system of linear equations is presented. The last section of the paper contains some examples illustrating that the differentiability property proved cannot be generalized straightforwardly to more general convex programs in conic form.
    0 references
    linear semidefinite programming
    0 references
    sensitivity
    0 references
    strict complementarity
    0 references

    Identifiers