Unconstrained convex programming approach to linear programming (Q1905944): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
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 |
Revision as of 08:19, 24 May 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
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