Unconstrained convex programming approach to linear programming (Q1905944): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q3690580 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Least-norm linear programming solution as an unconstrained minimization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An unconstrained convex programming view of linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deriving an unconstrained convex program for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming with entropic perturbation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02192167 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2047313019 / rank
 
Normal rank

Latest revision as of 08:57, 30 July 2024

scientific article
Language Label Description Also known as
English
Unconstrained convex programming approach to linear programming
scientific article

    Statements

    Unconstrained convex programming approach to linear programming (English)
    0 references
    0 references
    6 August 1996
    0 references
    perturbations
    0 references
    entropic barrier function
    0 references
    unconstrained dual concave program
    0 references
    sharp upper bound of error estimation
    0 references
    approximation scheme
    0 references

    Identifiers