A logarithmic barrier approach for linear programming (Q329787): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5588268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691079 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4296156 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4339096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extension of a projective interior point method for linearly constrained convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extended variant of Karmarkar's interior point algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of Karmarkar's projective algorithm for convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5309480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5309541 / 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: A numerical feasible interior point method for linear semidefinite programs / 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

Revision as of 18:40, 12 July 2024

scientific article
Language Label Description Also known as
English
A logarithmic barrier approach for linear programming
scientific article

    Statements

    Identifiers