Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem (Q732130): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Guo-Qiang Wang / 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.1016/j.cam.2009.07.014 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1979376655 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering and Economic Applications of Complementarity 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: On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem / 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 Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier / 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: A polynomial-time algorithm for linear optimization based on a new class of kernel functions / 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: Interior-point methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4339096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivaence between different formulations of the linear complementarity promblem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast convergence of the simplified largest step path following algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The largest step path following algorithm for monotone linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526886 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limiting Behavior of the Derivatives of Certain Trajectories Associated with a Monotone Horizontal Linear Complementarity Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global convergence enhancement of classical linesearch interior point methods for MCPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A matrix-splitting method for symmetric affine second-order cone complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The convergence of a one-step smoothing Newton method for \(P_0\)-NCP based on a new smoothing NCP-function / rank
 
Normal rank
Property / cites work
 
Property / cites work: A smoothing Gauss-Newton method for the generalized HLCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual interior-point algorithms for second-order cone optimization based on a new parametric kernel function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5453751 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems / rank
 
Normal rank

Latest revision as of 00:16, 2 July 2024

scientific article
Language Label Description Also known as
English
Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem
scientific article

    Statements

    Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem (English)
    0 references
    9 October 2009
    0 references
    The authors propose a class of polynomial interior-point algorithms for some horizontal linear complementarity problem based on a parametric kernel function. They analyze the interior-point algorithms using the uniformity of the kernel function. Also they develop some new analysis tools that are used in the complexity analysis of the algorithms and derive the currently best known iteration bounds for the algorithms with large and small update methods are presented.
    0 references
    0 references
    horizontal linear complementarity problem
    0 references
    kernel function
    0 references
    interior-point methods
    0 references
    iteration bounds
    0 references
    numerical examples
    0 references
    algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers