A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems (Q2249820): 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/s10898-013-0090-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2033871588 / 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)\) LCPs based on kernel functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aspects of semidefinite programming. Interior point algorithms and selected applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of LCPs associated with positive definite symmetric matrices / 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: A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems / 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: Unified Analysis of Kernel-Based Interior-Point Methods for $P_*(\kappa)$-Linear Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrector‐Predictor Methods for Sufficient Linear Complementarity Problems in a Wide Neighborhood of the Central Path / 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: A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039868 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Class of Superlinearly Convergent Polynomial Time Interior Point Methods for Sufficient LCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4339096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(P_ *\)-matrices are just sufficient / 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: Solving the Nonlinear Complementarity Problem by a Homotopy Method / 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: Q4382667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two interior-point methods for nonlinear \(P_*(\tau)\)-complementarity problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Globally and Locally Superlinearly Convergent Non--Interior-Point Algorithm for P<sub>0</sub>LCPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new path-following algorithm for nonlinear \(P_*\) complementarity problems / rank
 
Normal rank

Latest revision as of 17:57, 8 July 2024

scientific article
Language Label Description Also known as
English
A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems
scientific article

    Statements

    A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems (English)
    0 references
    3 July 2014
    0 references
    interior-point methods
    0 references
    linear complementarity problems
    0 references
    \(P_\ast(\kappa)\)-matrix
    0 references
    polynomial complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers