A path following algorithm for a class of convex programming problems (Q4016864): 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 long-step barrier method for convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: M.D.I. estimation via unconstrained convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4085461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained Information Theoretic Characterizations in Consumer Purchase Behaviour / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some methods for entropy maximization and matrix scaling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior path following primal-dual algorithms. I: Linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior path following primal-dual algorithms. II: Convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theory of Rational Random Behavior / rank
 
Normal rank

Revision as of 14:05, 16 May 2024

scientific article
Language Label Description Also known as
English
A path following algorithm for a class of convex programming problems
scientific article

    Statements

    Identifiers