Insights into the interior-point methods (Q4009794): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A variation on Karmarkar’s algorithm for solving linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Newton-type methods for unconstrained and linearly constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3491304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction: New approaches to linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692623 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3835293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5526145 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modification of Karmarkar's linear programming algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3835303 / rank
 
Normal rank

Latest revision as of 11:41, 16 May 2024

scientific article
Language Label Description Also known as
English
Insights into the interior-point methods
scientific article

    Statements

    Insights into the interior-point methods (English)
    0 references
    0 references
    0 references
    27 September 1992
    0 references
    interior-point algorithms
    0 references
    primal-affine scaling method
    0 references
    dual-affine scaling method
    0 references
    primal-dual interior point method
    0 references
    Karush-Kuhn-Tucker conditions
    0 references

    Identifiers