On the convergence analysis of arc search interior point methods for LCPs (Q2337791): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s13370-019-00697-w / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s13370-019-00697-w / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2946290855 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091004 / 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: Q3491304 / 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: A unified approach to interior point algorithms for linear complementarity problems: A summary / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mehrotra-type predictor-corrector algorithms for sufficient linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4901477 / rank
 
Normal rank
Property / cites work
 
Property / cites work: High-order predictor-corrector algorithms / 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 quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points / 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: Q3411977 / 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: An extension of Karmarkar's projective algorithm for convex quadratic 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: A polynomial arc-search interior-point algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127865481 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S13370-019-00697-W / rank
 
Normal rank

Latest revision as of 01:54, 18 December 2024

scientific article
Language Label Description Also known as
English
On the convergence analysis of arc search interior point methods for LCPs
scientific article

    Statements

    On the convergence analysis of arc search interior point methods for LCPs (English)
    0 references
    0 references
    20 November 2019
    0 references
    linear complementarity problem
    0 references
    ellipsoidal approximation
    0 references
    interior-point method
    0 references
    convergence analysis
    0 references

    Identifiers