Interior-point algorithm based on general kernel function for monotone linear complementarity problem (Q3572642): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11741-009-0201-3 / rank
Normal rank
 
Property / author
 
Property / author: Yan-Qin Bai / rank
Normal rank
 
Property / author
 
Property / author: Yan-Qin Bai / rank
 
Normal rank
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/s11741-009-0201-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1573443533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On homogeneous and self-dual algorithms for LCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of polynomially solvable linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path / 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: 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 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: On a Wide Region of Centers and Primal-Dual Interior Point Algorithms for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4339096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-regular functions and new search directions for linear and semidefinite optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new large-update interior point algorithm for \(P_{*}(\kappa)\) LCPs based on kernel functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal‐dual interior-point method for linear optimization based on a new proximity function / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11741-009-0201-3 / rank
 
Normal rank

Latest revision as of 12:31, 21 December 2024

scientific article
Language Label Description Also known as
English
Interior-point algorithm based on general kernel function for monotone linear complementarity problem
scientific article

    Statements

    Interior-point algorithm based on general kernel function for monotone linear complementarity problem (English)
    0 references
    0 references
    0 references
    8 July 2010
    0 references
    monotone linear complementarity problem
    0 references
    interior-point method
    0 references
    kernel function
    0 references
    polynomial complexity
    0 references

    Identifiers