On the public citation graph
A new continuation method for complementarity problems with uniformP-functions
0 signed · 78 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/978-1-4613-9617-8_2openalex-snapshot
A Primal-Dual Interior Point Algorithm for Linear Programming
inferredcites →https://doi.org/10.1007/bf01580248openalex-snapshot
Classes of functions and feasibility conditions in nonlinear complementarity problems
inferredcites →https://doi.org/10.1007/bf01580886openalex-snapshot
A note on degeneracy in linear programming
inferredcites →https://doi.org/10.1007/bf01587074openalex-snapshot
A polynomial-time algorithm for a class of linear complementarity problems
inferredcites →https://doi.org/10.1007/bf01681350openalex-snapshot
A unification of the existence theorems of the nonlinear complementarity problem
inferredcites →https://doi.org/10.1093/comjnl/12.3.207-aopenalex-snapshot
Nonlinear Programming--Sequential Unconstrained Minimization Techniques
inferredcites →https://doi.org/10.1112/blms/13.4.381openalex-snapshot
VARIATIONAL INEQUALITIES AND COMPLEMENTARITY PROBLEMS
inferredcites →https://doi.org/10.1137/0114012openalex-snapshot
Nonlinear Programs with Positively Bounded Jacobians
inferredcites →https://doi.org/10.1137/1016001openalex-snapshot
Coercivity Conditions in Nonlinear Complementarity Problems
inferredcites →https://doi.org/10.1137/1022003openalex-snapshot
Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
inferredcites →https://doi.org/10.1287/mnsc.11.7.681openalex-snapshot
Bimatrix Equilibrium Points and Mathematical Programming
inferredcites →https://doi.org/10.1287/mnsc.17.9.612openalex-snapshot
The Linear Complementarity Problem
inferredcites →https://doi.org/10.1515/9781400877492openalex-snapshot
Foundations of Algebraic Topology
inferredcites →https://doi.org/10.2140/pjm.1980.88.101openalex-snapshot
An analogue of Moreau’s proximation theorem, with application to the nonlinear complementarity problem
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/andp.200710278openalex-snapshot
Geodesic-invariant equations of gravitation
inferred← citeshttps://doi.org/10.1007/978-1-4615-5197-3_12openalex-snapshot
Existence and Limiting Behavior of Trajectories Associated with P0-equations
inferred← citeshttps://doi.org/10.1007/978-1-4757-3141-5_2openalex-snapshot
Complementarity Problems. Origins and Definitions
inferred← citeshttps://doi.org/10.1007/978-1-4757-3141-5_8openalex-snapshot
Exceptional Family of Elements and Complementarity
inferred← citeshttps://doi.org/10.1007/978-3-642-61257-2openalex-snapshot
Numerical Continuation Methods
inferred← citeshttps://doi.org/10.1007/978-3-662-02851-3_6openalex-snapshot
Nonconvex Optimization and Its Structural Frontiers
inferred← citeshttps://doi.org/10.1007/978-3-662-12629-5_52openalex-snapshot
Solving Linear Complementarity Problems by Imbedding
inferred← citeshttps://doi.org/10.1007/bf00940536openalex-snapshot
Solution differentiability and continuation of Newton's method for variational inequality problems over polyhedral sets
inferred← citeshttps://doi.org/10.1007/bf01581083openalex-snapshot
An interior point algorithm of $$O(\sqrt m \left| {\ln \varepsilon } \right|)$$ iterations forC 1-convex programming
inferred← citeshttps://doi.org/10.1007/bf01582255openalex-snapshot
Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
inferred← citeshttps://doi.org/10.1007/bf01582262openalex-snapshot
Newton's method for the nonlinear complementarity problem: A B-differentiable equation approach
inferred← citeshttps://doi.org/10.1007/bf01584847openalex-snapshot
A continuation method for (strongly) monotone variational inequalities
inferred← citeshttps://doi.org/10.1007/bf01585559openalex-snapshot
A continuation method for monotone variational inequalities
inferred← citeshttps://doi.org/10.1007/bf01588796openalex-snapshot
On the convergence of the method of analytic centers when applied to convex quadratic programs
inferred← citeshttps://doi.org/10.1007/bf02192160openalex-snapshot
A Newton-type method for positive-semidefinite linear complementarity problems
inferred← citeshttps://doi.org/10.1007/bf02192201openalex-snapshot
Interior-point methods for nonlinear complementarity problems
inferred← citeshttps://doi.org/10.1007/bf02209613openalex-snapshot
A pathsearch damped Newton method for computing general equilibria
inferred← citeshttps://doi.org/10.1007/bf02283687openalex-snapshot
Interior-point algorithms for global optimization
inferred← citeshttps://doi.org/10.1007/bf02614359openalex-snapshot
Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems
inferred← citeshttps://doi.org/10.1007/bf02878714openalex-snapshot
Infeasible-interior-point algorithm for a class of nonmonotone complementarity problems and its computational complexity
inferred← citeshttps://doi.org/10.1007/bfb0083587openalex-snapshot
On the method of analytic centers for solving smooth convex programs
inferred← citeshttps://doi.org/10.1007/s002110050378openalex-snapshot
An inexact QP -based method for nonlinear complementarity problems
inferred← citeshttps://doi.org/10.1007/s101070100283openalex-snapshot
A BFGS-IP algorithm for solving strongly convex optimization problems with feasibility enforced by an exact penalty approach
inferred← citeshttps://doi.org/10.1007/s10957-018-1422-2openalex-snapshot
A Continuation Method for Tensor Complementarity Problems
inferred← citeshttps://doi.org/10.1007/s10957-019-01568-xopenalex-snapshot
Tensor Complementarity Problems—Part II: Solution Methods
inferred← citeshttps://doi.org/10.1016/0893-9659(91)90162-oopenalex-snapshot
A polynomial-time algorithm for affine variational inequalities
inferred← citeshttps://doi.org/10.1016/j.amc.2012.01.003openalex-snapshot
The numerical study of a regularized smoothing Newton method for solving P0-NCP based on the generalized smoothing Fischer–Burmeister function
inferred← citeshttps://doi.org/10.1016/s0167-6377(96)00044-2openalex-snapshot
A new approach to continuation methods for complementarity problems with uniform P-functions
inferred← citeshttps://doi.org/10.1023/a:1008352130456openalex-snapshot
Exceptional Families and Existence Results for Nonlinear Complementarity Problem
inferred← citeshttps://doi.org/10.1023/a:1008688302346openalex-snapshot
Existence and Limiting Behavior of Trajectories Associated with P0-equations
inferred← citeshttps://doi.org/10.1023/a:1014886302772openalex-snapshot
A Globally Convergent Smoothing Newton Method for Nonsmooth Equations and Its Application to Complementarity Problems
inferred← citeshttps://doi.org/10.1023/a:1021704311867openalex-snapshot
Functions Without Exceptional Family of Elements and Complementarity Problems
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:1026459501988openalex-snapshot
Strict Feasibility Conditions in Nonlinear Complementarity Problems
inferred← citeshttps://doi.org/10.1023/b:coap.0000013059.84424.afopenalex-snapshot
Convergence Analysis of an Infeasible Interior Point Algorithm Based on a Regularized Central Path for Linear Complementarity Problems
inferred← citeshttps://doi.org/10.1023/b:jogo.0000035001.77804.f9openalex-snapshot
Explicit and Implicit Continuation Algorithms for Strongly Monotone Variational Inequalities with Box Constraints
inferred← citeshttps://doi.org/10.1080/02331930008844515openalex-snapshot
A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems*
inferred← citeshttps://doi.org/10.1080/02331930802355317openalex-snapshot
A new homotopy method for solving non-linear complementarity problems
inferred← citeshttps://doi.org/10.1080/02331939508844071openalex-snapshot
A quadratically convergent scaling newton’s method for nonlinear complementarity problems
inferred← citeshttps://doi.org/10.1080/10556789508805603openalex-snapshot
Interior-point methods via self-concordance or relative lipschitz condition
inferred← citeshttps://doi.org/10.1137/0610020openalex-snapshot
Continuous Homotopies for the Linear Complementarity Problem
inferred← citeshttps://doi.org/10.1137/0614081openalex-snapshot
A Non-Interior-Point Continuation Method for Linear Complementarity Problems
inferred← citeshttps://doi.org/10.1137/0803019openalex-snapshot
On the Superlinear Convergence of Interior-Point Algorithms for a General Class of Problems
inferred← citeshttps://doi.org/10.1137/0805007openalex-snapshot
A Positive Algorithm for the Nonlinear Complementarity Problem
inferred← citeshttps://doi.org/10.1137/0805008openalex-snapshot
A Practical Interior-Point Method for Convex Programming
inferred← citeshttps://doi.org/10.1137/s0036144595285963openalex-snapshot
Engineering and Economic Applications of Complementarity Problems
inferred← citeshttps://doi.org/10.1137/s0363012998345196openalex-snapshot
Properties of a Multivalued Mapping Associated with Some Nonmonotone Complementarity Problems
inferred← citeshttps://doi.org/10.1137/s0895479894273134openalex-snapshot
Some Noninterior Continuation Methods for Linear Complementarity Problems
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/s1052623498344720openalex-snapshot
A Feasible BFGS Interior Point Algorithm for Solving Convex Minimization Problems
inferred← citeshttps://doi.org/10.1287/moor.15.4.662openalex-snapshot
Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems
inferred← citeshttps://doi.org/10.1287/moor.16.4.754openalex-snapshot
Homotopy Continuation Methods for Nonlinear Complementarity Problems
inferred← citeshttps://doi.org/10.1287/moor.18.1.128openalex-snapshot
Existence of Interior Points and Interior Paths in Nonlinear Monotone Complementarity Problems
inferred← citeshttps://doi.org/10.1287/moor.18.4.945openalex-snapshot
A General Framework of Continuation Methods for Complementarity Problems
inferred← citeshttps://doi.org/10.1287/moor.21.3.589openalex-snapshot
Global Methods for Nonlinear Complementarity Problems
inferred← citeshttps://doi.org/10.1287/moor.21.3.629openalex-snapshot
Properties of an Interior-Point Mapping for Mixed Complementarity Problems
inferred← citeshttps://doi.org/10.1287/moor.21.4.793openalex-snapshot
Limiting Behavior of the Derivatives of Certain Trajectories Associated with a Monotone Horizontal Linear Complementarity Problem
inferred← citeshttps://doi.org/10.1287/moor.26.1.119.10594openalex-snapshot
On a New Homotopy Continuation Trajectory for Nonlinear Complementarity Problems
inferred← citeshttps://doi.org/10.2298/yjor0201017lopenalex-snapshot
Long step homogeneous interior point algorithm for the p* nonlinear complementarity problems
inferred← citeshttps://doi.org/10.5687/iscie.16.591openalex-snapshot
A Note on Continuation Method for Strongly Monotone Variational Inequalities under Slater's Constraint Qualification
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.