An unconstrained convex programming view of linear programming (Q4007117): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3702408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropy in linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Confidence levels using noral approxiation to modified<i>t</i>-Statistics for dependent Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratically constrained minimum cross-entropy analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588268 / 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: Symmetric Duality for Generalized Unconstrained Geometric Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank

Latest revision as of 12:12, 16 May 2024

scientific article
Language Label Description Also known as
English
An unconstrained convex programming view of linear programming
scientific article

    Statements

    An unconstrained convex programming view of linear programming (English)
    0 references
    0 references
    0 references
    27 September 1992
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    interior-point method
    0 references
    entropic barrier function
    0 references
    dual problem
    0 references
    unconstrained convex programming
    0 references
    computation of \(\varepsilon\)-optimal solutions
    0 references