Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood (Q1787924): 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/s10100-018-0524-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2793154127 / 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 class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of large-update and small-update primal-dual interior-point algorithms for linear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3415802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new \(O(\sqrt{n}L)\)-iteration predictor-corrector algorithm with wide neighborhood for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4362984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: EP theorem for dual linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial path-following interior point algorithm for general linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2867373 / 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 predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to interior point algorithms for linear complementary problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unified Analysis of Kernel-Based Interior-Point Methods for $P_*(\kappa)$-Linear Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with $O(\sqrt{n}\log\frac{\mathrm{Tr}(X^0S^0)}{\epsilon})$ Iteration Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4791754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(\sqrt nL)\) wide neighborhood interior-point algorithm for semidefinite optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Mizuno-Todd-Ye algorithm in a larger neighborhood of the central path / rank
 
Normal rank
Property / cites work
 
Property / cites work: A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with \(O(\sqrt nL)\)-iteration complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior Point Methods for Sufficient Horizontal LCP in a Wide Neighborhood of the Central Path with Best Known Iteration Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path / rank
 
Normal rank
Property / cites work
 
Property / cites work: Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual target-following algorithms for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3738934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel search paths for the simplex algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691079 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382667 / rank
 
Normal rank

Latest revision as of 18:15, 16 July 2024

scientific article
Language Label Description Also known as
English
Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood
scientific article

    Statements

    Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood (English)
    0 references
    0 references
    0 references
    5 October 2018
    0 references
    linear programming
    0 references
    large-step algorithm
    0 references
    wide neighbourhood
    0 references
    polynomial complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers