Complexity analysis of interior point methods for linear programming based on a parameterized kernel function (Q2954362): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1051/ro/2015056 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2539825244 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4347846 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm for linear optimization based on a new simple kernel function / 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 Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of large-update and small-update primal-dual interior-point algorithms for linear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interior-point algorithm for linear optimization based on a new barrier function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm for linear optimization based on a new class of kernel functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generic Primal-dual Interior Point Methods Based on a New Kernel Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path-Following Methods for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4296156 / 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: Self-regular functions and new search directions for linear and semidefinite optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4791754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691079 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382667 / rank
 
Normal rank

Latest revision as of 06:43, 13 July 2024

scientific article
Language Label Description Also known as
English
Complexity analysis of interior point methods for linear programming based on a parameterized kernel function
scientific article

    Statements

    Complexity analysis of interior point methods for linear programming based on a parameterized kernel function (English)
    0 references
    0 references
    0 references
    0 references
    12 January 2017
    0 references
    linear optimization
    0 references
    kernel function
    0 references
    interior point methods
    0 references
    complexity bound
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references