An \(\ell_{2}\)-neighborhood infeasible interior-point algorithm for linear complementarity problems (Q2399607): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
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: Q4091004 / 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 unified approach to interior point algorithms for linear complementarity problems: A summary / 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 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: A full-Newton step infeasible interior-point algorithm for monotone LCP based on a locally-kernel function / rank
 
Normal rank
Property / cites work
 
Property / cites work: A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence / 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: 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: An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming / 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: An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path / 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

Revision as of 07:02, 14 July 2024

scientific article
Language Label Description Also known as
English
An \(\ell_{2}\)-neighborhood infeasible interior-point algorithm for linear complementarity problems
scientific article

    Statements

    An \(\ell_{2}\)-neighborhood infeasible interior-point algorithm for linear complementarity problems (English)
    0 references
    0 references
    0 references
    24 August 2017
    0 references
    linear complementarity problem
    0 references
    ellipsoidal approximation
    0 references
    interior-point methods
    0 references
    polynomial complexity
    0 references
    0 references

    Identifiers