On the public citation graph
Predictor-corrector algorithm for solvingP *(κ)-matrix LCP from arbitrary positive starting points
0 signed · 54 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-54509-3openalex-snapshot
A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems
inferredcites →https://doi.org/10.1007/bf01204707openalex-snapshot
A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems
inferredcites →https://doi.org/10.1007/bf01300971openalex-snapshot
Local convergence of interior-point algorithms for degenerate monotone LCP
inferredcites →https://doi.org/10.1007/bf01582211openalex-snapshot
An infeasible-interior-point algorithm for linear complementarity problems
inferredcites →https://doi.org/10.1007/bf01585565openalex-snapshot
A quadratically convergent $$O((\kappa + 1)\sqrt n L)$$ -iteration algorithm for theP *(κ)-matrix linear complementarity problem
inferredcites →https://doi.org/10.1007/bf02206812openalex-snapshot
AnO(nL) infeasible-interior-point algorithm for LCP with quadratic convergence
inferredcites →https://doi.org/10.1007/s002459900016openalex-snapshot
A Unified Approach to Infeasible-Interior-Point Algorithms via Geometrical Linear Complementarity Problems
inferredcites →https://doi.org/10.1080/10556789308805537openalex-snapshot
A path-following infeasible-interior-point algorithm for linear complementarity problems
inferredcites →https://doi.org/10.1080/10556789508805628openalex-snapshot
A predictor-corrector method for solving the P * ( k )-matrix lcp from infeasible starting points
inferredcites →https://doi.org/10.1137/0804012openalex-snapshot
On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
inferredcites →https://doi.org/10.1137/s1052623494267826openalex-snapshot
A Quadratically Convergent Infeasible-Interior-Point Algorithm for LCP with Polynomial Complexity
inferredcites →https://doi.org/10.1287/moor.21.2.382openalex-snapshot
A Superlinearly Convergent Infeasible-Interior-Point Algorithm for Geometrical LCPs Without a Strictly Complementary Condition
inferredcites →https://doi.org/10.2172/432433openalex-snapshot
A superquadratic infeasible-interior-point method for linear complementarity problems
inferredcites →https://doi.org/10.2172/432434openalex-snapshot
A path-following interior-point algorithm for linear and quadratic problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/bf02592215openalex-snapshot
A superquadratic infeasible-interior-point method for linear complementarity problems
inferred← citeshttps://doi.org/10.1007/bf02683343openalex-snapshot
An infeasible-interior-point predictor-corrector algorithm for theP *-geometric LCP
inferred← citeshttps://doi.org/10.1007/s10100-018-0524-0openalex-snapshot
Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood
inferred← citeshttps://doi.org/10.1007/s10100-019-00622-3openalex-snapshot
A corrector–predictor interior-point method with new search direction for linear optimization
inferred← citeshttps://doi.org/10.1007/s10107-006-0068-2openalex-snapshot
Corrector–predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
inferred← citeshttps://doi.org/10.1007/s10589-005-3905-yopenalex-snapshot
A New Path-Following Algorithm for Nonlinear P*Complementarity Problems
inferred← citeshttps://doi.org/10.1007/s10852-013-9246-4openalex-snapshot
A Large-Update Interior-Point Method for Cartesian P ∗(κ)-LCP Over Symmetric Cones
inferred← citeshttps://doi.org/10.1007/s10898-013-0090-xopenalex-snapshot
A full-Newton step feasible interior-point algorithm for $$P_*(\kappa )$$ P ∗ ( κ ) -linear complementarity problems
inferred← citeshttps://doi.org/10.1007/s10957-009-9634-0openalex-snapshot
Improved Full-Newton Step O(nL) Infeasible Interior-Point Method for Linear Optimization
inferred← citeshttps://doi.org/10.1007/s10957-011-9938-8openalex-snapshot
A Class of Polynomial Interior Point Algorithms for the Cartesian P-Matrix Linear Complementarity Problem over Symmetric Cones
inferred← citeshttps://doi.org/10.1007/s10957-018-1402-6openalex-snapshot
Large-Neighborhood Infeasible Predictor–Corrector Algorithm for Horizontal Linear Complementarity Problems over Cartesian Product of Symmetric Cones
inferred← citeshttps://doi.org/10.1007/s10998-016-0119-2openalex-snapshot
Complexity analysis of a full-Newton step interior-point method for linear optimization
inferred← citeshttps://doi.org/10.1007/s11424-014-1273-3openalex-snapshot
A full-Newton step infeasible interior-point algorithm for P *(κ) linear complementarity problem
inferred← citeshttps://doi.org/10.1007/s11425-008-0174-0openalex-snapshot
Path-following interior point algorithms for the Cartesian P *(κ)-LCP over symmetric cones
inferred← citeshttps://doi.org/10.1007/s11590-014-0800-4openalex-snapshot
New complexity analysis of a full-Newton step feasible interior-point algorithm for $$P_*(\kappa )$$ P ∗ ( κ ) -LCP
inferred← citeshttps://doi.org/10.1007/s11590-017-1171-4openalex-snapshot
New method for determining search directions for interior-point algorithms in linear optimization
inferred← citeshttps://doi.org/10.1007/s12190-020-01356-1openalex-snapshot
A new full-Newton step interior-point method for $$P_{*}(\kappa )$$-LCP based on a positive-asymptotic kernel function
inferred← citeshttps://doi.org/10.1016/j.ejco.2023.100072openalex-snapshot
Large-step predictor-corrector interior point method for sufficient linear complementarity problems based on the algebraic equivalent transformation
inferred← citeshttps://doi.org/10.1016/j.ejco.2026.100133openalex-snapshot
Predictor-corrector interior-point algorithm for sufficient linear complementarity problems based on AET functions with bounded proportional growth rate
inferred← citeshttps://doi.org/10.1016/j.ejor.2005.08.031openalex-snapshot
A Mizuno–Todd–Ye type predictor–corrector algorithm for sufficient linear complementarity problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2021.08.039openalex-snapshot
Predictor-corrector interior-point algorithm for P*(κ) -linear complementarity problems based on a new type of algebraic equivalent transformation technique
inferred← citeshttps://doi.org/10.1016/s0096-3003(98)10125-xopenalex-snapshot
D-orientation sequences for continuous functions and nonlinear complementarity problems
inferred← citeshttps://doi.org/10.1023/a:1004674330768openalex-snapshot
Quasi-P*-Maps, P(τ, α, β)-Maps, Exceptional Family of Elements, and Complementarity Problems
inferred← citeshttps://doi.org/10.1023/a:1008202323884openalex-snapshot
Exceptional Family of Elements for a Variational Inequality Problem and its Applications
inferred← citeshttps://doi.org/10.1023/a:1018942131812openalex-snapshot
A path following method for LCP withsuperlinearly convergent iteration sequence
inferred← citeshttps://doi.org/10.1023/a:1022606324827openalex-snapshot
Two Interior-Point Methods for Nonlinear P *(τ)-Complementarity Problems
inferred← citeshttps://doi.org/10.1023/a:1022670415661openalex-snapshot
Superlinearly Convergent Infeasible-Interior-Point Algorithm for Degenerate LCP
inferred← citeshttps://doi.org/10.1080/01630560701277930openalex-snapshot
An Infeasible Mizuno–Todd–Ye Type Algorithm for Convex Quadratic Programming with Polynomial Complexity
inferred← citeshttps://doi.org/10.1080/01630563.2010.520217openalex-snapshot
A Class of Infeasible Interior Point Algorithms for Convex Quadratic Programming
inferred← citeshttps://doi.org/10.1080/01630563.2013.836107openalex-snapshot
Infeasible Mehrotra-Type Predictor-Corrector Interior-Point Algorithm for the CartesianP*(κ)-LCP Over Symmetric Cones
inferred← citeshttps://doi.org/10.1080/01630563.2018.1492938openalex-snapshot
New Interior-Point Algorithm for Symmetric Optimization Based on a Positive-Asymptotic Barrier Function
inferred← citeshttps://doi.org/10.1080/02331934.2013.820300openalex-snapshot
Polynomial convergence of Mehrotra-type predictor–corrector algorithm for the CartesianP∗(κ)-LCP over symmetric cones
inferred← citeshttps://doi.org/10.1080/02331934.2018.1432610openalex-snapshot
A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions
inferred← citeshttps://doi.org/10.1080/02331934.2024.2396541openalex-snapshot
Large-step algorithm for linear complementarity problem with new search direction
inferred← citeshttps://doi.org/10.1080/10556788.2013.781600openalex-snapshot
Full Nesterov–Todd step feasible interior-point method for the CartesianP*(κ)-SCLCP
inferred← citeshttps://doi.org/10.1137/080716979openalex-snapshot
On a Class of Superlinearly Convergent Polynomial Time Interior Point Methods for Sufficient LCP
inferred← citeshttps://doi.org/10.1137/19m1248972openalex-snapshot
Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction
inferred← citeshttps://doi.org/10.20454/jmmnm.2012.67openalex-snapshot
On Extending Some Wide-neighborhood Interior Point Algorithms From Linear Programming To Linear Complementarity Problems
inferred← citeshttps://doi.org/10.3934/math.2026912openalex-snapshot
Complexity of a predictor-corrector interior-point method using special kernel function for sufficient WLCPs
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.