Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming (Q1989949): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(8 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Matlab / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CurveLP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LIPSOL / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PCx / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3102461863 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1609.00694 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691079 / 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: Computational experience with a primal-dual interior point method for linear programming / 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: 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 for a class of linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3491304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4051879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3050157 / 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: The many facets of linear 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: A polynomial arc-search interior-point algorithm for convex quadratic programming / 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: Polynomiality of infeasible-interior-point algorithms for linear programming / 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: An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming / 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: Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modification of the minimum-degree algorithm by multiple elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degeneracy in interior point methods for linear programming: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential Minimax Search for a Maximum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3688092 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally convergent algorithms for robust pole assignment by state feedback / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:43, 17 July 2024

scientific article
Language Label Description Also known as
English
Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming
scientific article

    Statements

    Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming (English)
    0 references
    0 references
    29 October 2018
    0 references
    0 references
    polynomial algorithm
    0 references
    arc-search
    0 references
    infeasible interior-point method
    0 references
    linear programming
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references