Logarithmic Barrier Method Via Minorant Function for Linear Programming (Q5853371): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q2693232
Created claim: Wikidata QID (P12): Q128181833, #quickstatements; #temporary_batch_1722794872778
 
(5 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Assma Leulmi / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2924217018 / 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: New bounds for the extreme values of a finite sample of real numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4496026 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Study of a Logarithmic Barrier Approach for Linear Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logarithmic barrier approach for linear programming / 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
Property / Wikidata QID
 
Property / Wikidata QID: Q128181833 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:16, 4 August 2024

scientific article; zbMATH DE number 7325495
Language Label Description Also known as
English
Logarithmic Barrier Method Via Minorant Function for Linear Programming
scientific article; zbMATH DE number 7325495

    Statements

    Identifiers