An adaptive-step primal-dual interior point algorithm for linear optimization (Q425813): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: H. S. Yoon / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C51 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6044659 / rank
 
Normal rank
Property / zbMATH Keywords
 
adaptive-step
Property / zbMATH Keywords: adaptive-step / rank
 
Normal rank
Property / zbMATH Keywords
 
primal-dual interior point method
Property / zbMATH Keywords: primal-dual interior point method / rank
 
Normal rank
Property / zbMATH Keywords
 
large-update
Property / zbMATH Keywords: large-update / rank
 
Normal rank
Property / zbMATH Keywords
 
kernel function
Property / zbMATH Keywords: kernel function / rank
 
Normal rank
Property / zbMATH Keywords
 
polynomial algorithm
Property / zbMATH Keywords: polynomial algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
worst-case complexity
Property / zbMATH Keywords: worst-case complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
linear optimization problem
Property / zbMATH Keywords: linear optimization problem / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.na.2009.05.021 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2077264651 / 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: Primal-dual target-following algorithms for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691079 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3491304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4206561 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4791754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic large-update primal‐dual interior-point method for linear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive self-regular proximity-based large-update IPM for LO / rank
 
Normal rank
Property / cites work
 
Property / cites work: A self-adjusting primal–dual interior point method for linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4347846 / 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: On the Implementation of a Primal-Dual Interior Point Method / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:26, 5 July 2024

scientific article
Language Label Description Also known as
English
An adaptive-step primal-dual interior point algorithm for linear optimization
scientific article

    Statements

    An adaptive-step primal-dual interior point algorithm for linear optimization (English)
    0 references
    0 references
    0 references
    9 June 2012
    0 references
    adaptive-step
    0 references
    primal-dual interior point method
    0 references
    large-update
    0 references
    kernel function
    0 references
    polynomial algorithm
    0 references
    worst-case complexity
    0 references
    linear optimization problem
    0 references

    Identifiers