New complexity analysis of IIPMs for linear optimization based on a specific self-regular function (Q2462141): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2007.02.008 / rank
Normal rank
 
Property / author
 
Property / author: Tamás Terlaky / rank
Normal rank
 
Property / author
 
Property / author: Tamás Terlaky / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: McIPM / 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.ejor.2007.02.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2026131915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4347846 / 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 primal-dual infeasible-interior-point algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feasibility issues in a primal-dual interior-point method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4206561 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomiality of infeasible-interior-point algorithms 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: A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4339096 / 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: The complexity of self-regular proximity based infeasible IPMs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3738934 / 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: An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2007.02.008 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:14, 18 December 2024

scientific article
Language Label Description Also known as
English
New complexity analysis of IIPMs for linear optimization based on a specific self-regular function
scientific article

    Statements

    New complexity analysis of IIPMs for linear optimization based on a specific self-regular function (English)
    0 references
    0 references
    0 references
    0 references
    23 November 2007
    0 references
    linear optimization
    0 references
    infeasible interior point methods
    0 references
    self-regular functions
    0 references
    adaptive large update
    0 references
    polynomial complexity
    0 references

    Identifiers