An infeasible-interior-point algorithm for linear complementarity problems
From MaRDI portal
Recommendations
- A new infeasible interior-point algorithm for linear complementarity problem
- An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence
- An Infeasible-Interior-Point Method for Linear Complementarity Problems
- A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
Cites work
- A primal-dual infeasible-interior-point algorithm for linear programming
- A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points
- Computational experience with a globally convergent primal-dual predictor-corrector algorithm for linear programming
- Computational schemes for large-scale problems in extended linear- quadratic programming
- Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
- On Q-order and R-order of convergence
- On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence
- Superlinear convergence of infeasible-interior-point methods for linear programming
Cited in
(30)- scientific article; zbMATH DE number 1552029 (Why is no real title available?)
- An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence
- scientific article; zbMATH DE number 1506063 (Why is no real title available?)
- Neural network for solving SOCQP and SOCCVI based on two discrete-type classes of SOC complementarity functions
- A combined homotopy interior point method for the linear complementarity problem
- On the equivalence of linear complementarity problems
- A novel gradient-based neural network for solving convex second-order cone constrained variational inequality problems
- On quasi-solution to infeasible linear complementarity problem obtained by Lemke's method
- A superlinearly convergent smoothing Newton continuation algorithm for variational inequalities over definable sets
- A full-Newton step infeasible interior-point algorithm for monotone LCP based on a locally-kernel function
- scientific article; zbMATH DE number 2104098 (Why is no real title available?)
- Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
- An infeasible interior point method for the monotone linear complementarity problem
- An infeasible-start path-following method for monotone LCPs
- LOQO:an interior point code for quadratic programming
- The complexity of self-regular proximity based infeasible IPMs
- An adaptive infeasible interior-point algorithm for linear complementarity problems
- scientific article; zbMATH DE number 1839764 (Why is no real title available?)
- An \(\ell_{2}\)-neighborhood infeasible interior-point algorithm for linear complementarity problems
- Neural networks for solving second-order cone constrained variational inequality problem
- Convergence analysis of an infeasible interior point algorithm based on a regularized central path for linear complementarity problems
- A new neural network model for solving random interval linear programming problems
- A superquadratic infeasible-interior-point method for linear complementarity problems
- A path-following interior-point algorithm for linear and quadratic problems
- A smoothed NR neural network for solving nonlinear convex programs with second-order cone constraints
- An arc-search infeasible interior-point algorithm for horizontal linear complementarity problem in the N∞− neighbourhood of the central path
- Optimized choice of parameters in interior-point methods for linear programming
- Global convergence enhancement of classical linesearch interior point methods for MCPs
- A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems
- An Infeasible-Interior-Point Method for Linear Complementarity Problems
This page was built for publication: An infeasible-interior-point algorithm for linear complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1340065)
