A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems (Q2356344): 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/s40305-015-0070-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2056108806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new primal-dual path-following method for convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An infeasible-interior-point predictor-corrector algorithm for the \(P_ *\)-geometric LCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Full-Newton step infeasible-interior-point algorithm for P*(k)-horizontal linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new full-Newton step \(O(n)\) infeasible interior-point algorithm for \(P_\ast(\kappa)\)-horizontal linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm for linear optimization based on a new simple kernel function / 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: 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: Q5453751 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generic Primal-dual Interior Point Methods Based on a New Kernel Function / 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: Fast convergence of the simplified largest step path following algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrector-predictor methods for sufficient linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3477904 / 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: Test examples for nonlinear programming codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526886 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Asymptotical $O(\sqrt{n} L)$-Iteration Path-Following Linear Programming Algorithm That Uses Wide Neighborhoods / 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: A unified approach to interior point algorithms for linear complementarity problems: A summary / 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: 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: On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4791754 / 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: Q4339096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A smoothing Gauss-Newton method for the generalized HLCP / rank
 
Normal rank

Latest revision as of 13:44, 10 July 2024

scientific article
Language Label Description Also known as
English
A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems
scientific article

    Statements

    A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems (English)
    0 references
    0 references
    0 references
    0 references
    29 July 2015
    0 references
    horizontal linear complementarity problem
    0 references
    interior-point method
    0 references
    central path
    0 references
    polynomial complexity
    0 references
    kernel function
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers