An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming (Q1653277): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Ya-Guang Yang / rank
Normal rank
 
Property / author
 
Property / author: Ya-Guang Yang / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Netlib / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CurveLP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3100349759 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1506.06365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feature Article—The Ellipsoid Method: A Survey / 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 / cites work
 
Property / cites work: Q4091004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial affine algorithms for linear programming / 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: Polynomial algorithms in linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4051879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs / 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: A polynomial-time algorithm for a class of linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Implementation of a Primal-Dual Interior Point Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Infeasible Interior-Point Predictor-Corrector Algorithms for Linear Programming / 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: On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm, based on Newton's method, for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Mehrotra-Type Predictor-Corrector Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mehrotra-type predictor-corrector algorithm revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2879562 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691079 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A wide neighborhood infeasible-interior-point method with arc-search for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial arc-search interior-point algorithm for convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial arc-search interior-point algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(n^ 3L)\) potential reduction algorithm for linear programming / rank
 
Normal rank

Latest revision as of 05:44, 16 July 2024

scientific article
Language Label Description Also known as
English
An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming
scientific article

    Statements

    An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming (English)
    0 references
    0 references
    0 references
    3 August 2018
    0 references
    polynomial algorithm
    0 references
    infeasible-interior-point method
    0 references
    linear programming
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers