A wide neighborhood infeasible-interior-point method with arc-search for linear programming (Q295450): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1007/s12190-015-0900-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W609648197 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighborhood-following algorithms for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>O</i>$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Infinity-Norm Path Following Algorithm for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Asymptotical $O(\sqrt{n} L)$-Iteration Path-Following Linear Programming Algorithm That Uses Wide Neighborhoods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved complexity using higher-order correctors for primal-dual Dikin affine scaling / 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: Feasibility issues in 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: 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: On the Implementation of a Primal-Dual Interior Point Method / 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: Long-step strategies in interior-point primal-dual methods / 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: Interior Point Methods for Linear Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An entire space polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691079 / 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: On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms / 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

Latest revision as of 04:17, 12 July 2024

scientific article
Language Label Description Also known as
English
A wide neighborhood infeasible-interior-point method with arc-search for linear programming
scientific article

    Statements

    A wide neighborhood infeasible-interior-point method with arc-search for linear programming (English)
    0 references
    0 references
    0 references
    0 references
    13 June 2016
    0 references
    0 references
    linear programming
    0 references
    infeasible-interior-point method
    0 references
    arc-search
    0 references
    wide neighborhood
    0 references
    complexity
    0 references
    0 references
    0 references