An interior point method for linear programming based on a class of Kernel functions (Q4654260): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4692623 / 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: A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new class of polynomial primal-dual methods for linear and semidefinite optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4339096 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4791754 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Self-regular functions and new search directions for linear and semidefinite optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5691079 / rank | |||
Normal rank |
Latest revision as of 19:18, 7 June 2024
scientific article; zbMATH DE number 2140426
Language | Label | Description | Also known as |
---|---|---|---|
English | An interior point method for linear programming based on a class of Kernel functions |
scientific article; zbMATH DE number 2140426 |
Statements
An interior point method for linear programming based on a class of Kernel functions (English)
0 references
3 March 2005
0 references
interior point methods
0 references
linear programming
0 references
kernel functions
0 references
complexity
0 references
0 references
0 references