An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming (Q644523): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11590-010-0242-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2085309471 / 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: Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Encyclopedia of Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4496026 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple centrality corrections in a primal-dual method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path-Following Methods 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: Q3491304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding a vertex solution using interior point methods / 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 simpler and tighter redundant Klee-Minty construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics in semidefinite and interior-point methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior-point methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4339096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time second order mehrotra-type predictor--corrector algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Mehrotra-Type Predictor-Corrector Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691079 / 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 polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms / rank
 
Normal rank

Latest revision as of 15:27, 4 July 2024

scientific article
Language Label Description Also known as
English
An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming
scientific article

    Statements

    An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming (English)
    0 references
    4 November 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    second-order methods
    0 references
    polynomial complexity
    0 references
    0 references
    0 references
    0 references
    0 references