Study of a Logarithmic Barrier Approach for Linear Semidefinite Programming (Q5853250): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2809633558 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: A numerical feasible interior point method for linear semidefinite programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relaxed logarithmic barrier method for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical optimization. Theoretical and practical aspects. Transl. from the French / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logarithm barrier method for semi-definite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Local Convergence of a Predictor-Corrector Method for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some New Search Directions for Primal-Dual Interior Point Methods in Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds for the extreme values of a finite sample of real numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for eigenvalues using traces / rank
 
Normal rank

Revision as of 19:21, 24 July 2024

scientific article; zbMATH DE number 7325420
Language Label Description Also known as
English
Study of a Logarithmic Barrier Approach for Linear Semidefinite Programming
scientific article; zbMATH DE number 7325420

    Statements

    Identifiers