On the public citation graph
An infeasible-interior-point algorithm for linear complementarity problems
0 signed · 83 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/bf00939805openalex-snapshot
OnQ-order andR-order of convergence
inferredcites →https://doi.org/10.1007/bf01581140openalex-snapshot
Computational experience with a globally convergent primal—dual predictor—corrector algorithm for linear programming
inferredcites →https://doi.org/10.1007/bf01581155openalex-snapshot
Superlinear convergence of infeasible-interior-point methods for linear programming
inferredcites →https://doi.org/10.1007/bf01582151openalex-snapshot
A primal—dual infeasible-interior-point algorithm for linear programming
inferredcites →https://doi.org/10.1007/bf01582228openalex-snapshot
A quadratically convergent predictor—corrector method for solving linear programs from infeasible starting points
inferredcites →https://doi.org/10.1007/bf01582268openalex-snapshot
Computational schemes for large-scale problems in extended linear-quadratic programming
inferredcites →https://doi.org/10.1007/bf01585182openalex-snapshot
On quadratic and $$O\left( {\sqrt {nL} } \right)$$ convergence of a predictor—corrector algorithm for LCP
inferredcites →https://doi.org/10.1007/bf02192304openalex-snapshot
Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence
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/0805003openalex-snapshot
Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0754openalex-snapshot
Self‐Dual Embedding Technique for Linear Optimization
inferred← citeshttps://doi.org/10.1007/0-387-24276-7_18openalex-snapshot
Linear Complementarity Since 1978
inferred← citeshttps://doi.org/10.1007/978-0-387-77247-9_21openalex-snapshot
The Extended Linear Complementarity Problem and Its Applications in Analysis and Control of Discrete-Event Systems
inferred← citeshttps://doi.org/10.1007/978-1-4613-3449-1_5openalex-snapshot
Infeasible-Interior-Point Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-09129-7_19openalex-snapshot
A Study of the Complexity of an Infeasible Predictor-Corrector Variant of Mehrotra Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-16336-4_52openalex-snapshot
Iterative Method for a Class of Linear Complementarity Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-16530-6_55openalex-snapshot
Nonlinear Complementarity Problem and Solution Methods
inferred← citeshttps://doi.org/10.1007/978-3-642-46955-8_43openalex-snapshot
New Results on a Newton-Type Method for LCP
inferred← citeshttps://doi.org/10.1007/b100325openalex-snapshot
Interior Point Methods for Linear Optimization
inferred← citeshttps://doi.org/10.1007/bf01204707openalex-snapshot
A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems
inferred← citeshttps://doi.org/10.1007/bf01300971openalex-snapshot
Local convergence of interior-point algorithms for degenerate monotone LCP
inferred← citeshttps://doi.org/10.1007/bf01581155openalex-snapshot
Superlinear convergence of infeasible-interior-point methods for linear programming
inferred← citeshttps://doi.org/10.1007/bf02206809openalex-snapshot
Basic lemmas in polynomial-time infeasible-interiorpoint methods for linear programs
inferred← citeshttps://doi.org/10.1007/bf02206812openalex-snapshot
AnO(nL) infeasible-interior-point algorithm for LCP with quadratic convergence
inferred← citeshttps://doi.org/10.1007/bf02206813openalex-snapshot
A path-following interior-point algorithm for linear and quadratic problems
inferred← citeshttps://doi.org/10.1007/bf02206814openalex-snapshot
A Mehrotra-type predictor-corrector algorithm with polynomiality andQ-subquadratic convergence
inferred← citeshttps://doi.org/10.1007/bf02592210openalex-snapshot
An interior point potential reduction method for constrained equations
inferred← citeshttps://doi.org/10.1007/bf02592215openalex-snapshot
A superquadratic infeasible-interior-point method for linear complementarity problems
inferred← citeshttps://doi.org/10.1007/bf02614385openalex-snapshot
Predictor-corrector algorithm for solvingP *(κ)-matrix LCP from arbitrary positive starting points
inferred← citeshttps://doi.org/10.1007/s002450010021openalex-snapshot
Solution of a General Linear Complementarity Problem Using Smooth Optimization and Its Application to Bilinear Programming and LCP
inferred← citeshttps://doi.org/10.1007/s101070050091openalex-snapshot
An infeasible-interior-point potential-reduction algorithm for linear programming
inferred← citeshttps://doi.org/10.1007/s10589-005-3064-1openalex-snapshot
The Complexity of Self-Regular Proximity Based Infeasible IPMs
inferred← citeshttps://doi.org/10.1007/s10589-010-9359-xopenalex-snapshot
Neural networks for solving second-order cone constrained variational inequality problem
inferred← citeshttps://doi.org/10.1007/s10589-019-00079-9openalex-snapshot
Optimized choice of parameters in interior-point methods for linear programming
inferred← citeshttps://doi.org/10.1007/s11075-011-9530-1openalex-snapshot
A full-Newton step infeasible interior-point algorithm for monotone LCP based on a locally-kernel function
inferred← citeshttps://doi.org/10.1016/j.amc.2005.12.010openalex-snapshot
A combined homotopy interior point method for the linear complementarity problem
inferred← citeshttps://doi.org/10.1016/j.cam.2018.08.030openalex-snapshot
A novel gradient-based neural network for solving convex second-order cone constrained variational inequality problems
inferred← citeshttps://doi.org/10.1016/j.ins.2013.10.017openalex-snapshot
A smoothed NR neural network for solving nonlinear convex programs with second-order cone constraints
inferred← citeshttps://doi.org/10.1016/j.neunet.2016.12.007openalex-snapshot
A new neural network model for solving random interval linear programming problems
inferred← citeshttps://doi.org/10.1016/j.nima.2018.01.022openalex-snapshot
Nonnegative constraint quadratic program technique to enhance the resolution of γ spectra
inferred← citeshttps://doi.org/10.1016/s0167-6377(02)00159-1openalex-snapshot
On the equivalence of linear complementarity problems
inferred← citeshttps://doi.org/10.1016/s0377-0427(02)00745-8openalex-snapshot
Global convergence enhancement of classical linesearch interior point methods for MCPs
inferred← citeshttps://doi.org/10.1016/s0895-7177(03)90003-3openalex-snapshot
An infeasible-start path-following method for monotone LCPs
inferred← citeshttps://doi.org/10.1023/a:1008623505672openalex-snapshot
On Superlinear Convergence of Infeasible Interior-Point Algorithms for Linearly Constrained Convex Programs
inferred← citeshttps://doi.org/10.1023/a:1018905724427openalex-snapshot
On quadratic convergence of the $$O\left( {\sqrt {nL} } \right)$$ -iteration homogeneous and self‐duallinear programming algorithm
inferred← citeshttps://doi.org/10.1080/0952813x.2019.1647559openalex-snapshot
A new neural network framework for solving convex second-order cone constrained variational inequality problems with an application in multi-finger robot hands
inferred← citeshttps://doi.org/10.1080/10556789308805537openalex-snapshot
A path-following infeasible-interior-point algorithm for linear complementarity problems
inferred← citeshttps://doi.org/10.1080/10556789408805570openalex-snapshot
On the convergence of an infeasible primal-dual interior-point method for convex programming
inferred← citeshttps://doi.org/10.1080/10556789508805627openalex-snapshot
On the local superlinear convergence of a Newton-type method for LCP under weak conditions
inferred← citeshttps://doi.org/10.1080/10556789908805759openalex-snapshot
LOQO:an interior point code for quadratic programming
inferred← citeshttps://doi.org/10.1109/fcc.2009.8openalex-snapshot
A Feasible Interior Point Algorithm for a Class of Nonnegative Least Squares Problems
inferred← citeshttps://doi.org/10.1109/icic.2010.183openalex-snapshot
A New Method for Solving Bimatrix Games Problems
inferred← citeshttps://doi.org/10.1109/icic.2011.65openalex-snapshot
Feasible Interior Point Method for Absolute Value Equation
inferred← citeshttps://doi.org/10.1109/tnnls.2020.3008661openalex-snapshot
A Neural Network Based on the Metric Projector for Solving SOCCVI Problem
inferred← citeshttps://doi.org/10.1137/050623917openalex-snapshot
A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
inferred← citeshttps://doi.org/10.1137/0805007openalex-snapshot
A Positive Algorithm for the Nonlinear Complementarity Problem
inferred← citeshttps://doi.org/10.1137/0806001openalex-snapshot
A Superlinear Infeasible-Interior-Point Affine Scaling Algorithm for LCP
inferred← citeshttps://doi.org/10.1137/0806018openalex-snapshot
Convergence of an Infeasible Interior-Point Algorithm from Arbitrary Positive Starting Points
inferred← citeshttps://doi.org/10.1137/12087565xopenalex-snapshot
A Barrier-Based Smoothing Proximal Point Algorithm for NCPs over Closed Convex Cones
inferred← citeshttps://doi.org/10.1137/140957615openalex-snapshot
A Superlinearly Convergent Smoothing Newton Continuation Algorithm for Variational Inequalities over Definable Sets
inferred← citeshttps://doi.org/10.1137/s0363012993252711openalex-snapshot
On a Certain Parameter of the Discretized Extended Linear-Quadratic Problem of Optimal Control
inferred← citeshttps://doi.org/10.1137/s0895479893260498openalex-snapshot
Stability of Linear Equations Solvers in Interior-Point Methods
inferred← citeshttps://doi.org/10.1137/s1052623401384151openalex-snapshot
A Globally and Locally Superlinearly Convergent Non--Interior-Point Algorithm for P 0 LCPs
inferred← citeshttps://doi.org/10.1137/s1052623494267826openalex-snapshot
A Quadratically Convergent Infeasible-Interior-Point Algorithm for LCP with Polynomial Complexity
inferred← citeshttps://doi.org/10.1137/s1052623495279359openalex-snapshot
A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP
inferred← citeshttps://doi.org/10.1137/s1052623495282882openalex-snapshot
An Infeasible-Interior-Point Method for Linear Complementarity Problems
inferred← citeshttps://doi.org/10.1155/2019/4545064openalex-snapshot
Neural Network for Solving SOCQP and SOCCVI Based on Two Discrete‐Type Classes of SOC Complementarity Functions
inferred← citeshttps://doi.org/10.1287/moor.21.2.382openalex-snapshot
A Superlinearly Convergent Infeasible-Interior-Point Algorithm for Geometrical LCPs Without a Strictly Complementary Condition
inferred← citeshttps://doi.org/10.1287/moor.21.4.815openalex-snapshot
A Superlinear Infeasible-Interior-Point Algorithm for Monotone Complementarity Problems
inferred← citeshttps://doi.org/10.1287/moor.22.2.378openalex-snapshot
On the Convergence of the Iteration Sequence of Infeasible Path Following Algorithms for Linear Complementarity Problems
inferred← citeshttps://doi.org/10.1287/moor.24.1.176openalex-snapshot
Probabilistic Analysis of an Infeasible-Interior-Point Algorithm for Linear Programming
inferred← citeshttps://doi.org/10.1287/moor.24.1.72openalex-snapshot
Superlinear Convergence of an Algorithm for Monotone Linear Complementarity Problems, When No Strictly Complementary Solution Exists
inferred← citeshttps://doi.org/10.15807/jorsj.39.566openalex-snapshot
A PARALLEL PRIMAL-DUAL INTERIOR POINT METHOD FOR MULTICOMMODITY FLOW PROBLEMS WITH QUADRATIC COSTS
inferred← citeshttps://doi.org/10.1590/0101-7438.2025.045.00291706openalex-snapshot
A GONZAGA’S PROBLEM FOR LINEAR PROGRAMMING
inferred← citeshttps://doi.org/10.2172/432434openalex-snapshot
A path-following interior-point algorithm for linear and quadratic problems
inferred← citeshttps://doi.org/10.22436/jmcs.012.03.03openalex-snapshot
A Generalization Of Iteration-free Search Vectors Of Abs Methods
inferred← citeshttps://doi.org/10.3390/axioms11080370openalex-snapshot
Novel Global Harmony Search Algorithm for General Linear Complementarity Problem
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.101-102.236openalex-snapshot
Linear Complementarity Problem and Multiobjective Optimization
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.29-32.725openalex-snapshot
Solving Obstacle Problem Based on Potential-Reduction Interior Point Algorithm
inferred← citeshttps://doi.org/10.4236/jamp.2022.104071openalex-snapshot
A Modified Newton Method Based on the Metric Projector for Solving SOCCVI Problem
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.