A primal-dual interior point method for parametric semidefinite programming problems (Q1568250): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foreword to: Semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On parametric semidefinite programming / 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: Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal--Dual Path-Following Algorithms for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Interior-Point Method for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Analysis / rank
 
Normal rank

Latest revision as of 16:47, 29 May 2024

scientific article
Language Label Description Also known as
English
A primal-dual interior point method for parametric semidefinite programming problems
scientific article

    Statements

    A primal-dual interior point method for parametric semidefinite programming problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 June 2000
    0 references
    0 references
    interior-point method
    0 references
    semidefinite programming problem
    0 references
    \(\varepsilon\)-approximate solution
    0 references