An Infeasible-Interior-Point Method for Linear Complementarity Problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2104098
- An infeasible-interior-point algorithm for linear complementarity problems
- A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
- An infeasible interior point method for the monotone linear complementarity problem
- A new infeasible interior-point algorithm for linear complementarity problem
Cited in
(36)- An infeasible-interior-point algorithm for linear complementarity problems
- A finite improvement algorithm for the linear complementarity problem
- Global convergence enhancement of classical linesearch interior point methods for MCPs
- An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems
- A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems
- An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence
- Iterative descent method for generalized Leontief model
- A potential reduction method for tensor complementarity problems
- An efficient implementation of a trust region method for box constrained optimization
- The complexity of self-regular proximity based infeasible IPMs
- A limited memory quasi-Newton trust-region method for box constrained optimization
- An infeasible interior proximal method for convex programming problems with linear constraints
- Interior hybrid proximal extragradient methods for the linear monotone complementarity problem
- Newton-type interior-point methods for solving generalized complementarity problems in polyhedral cones
- An arc-search infeasible interior-point algorithm for horizontal linear complementarity problem in the N∞− neighbourhood of the central path
- AN O(n^3L) ALGORITHM USING A SEQUENCE FOR A LINEAR COMPLEMENTARITY PROBLEM
- scientific article; zbMATH DE number 5606390 (Why is no real title available?)
- An infeasible interior point method for the monotone linear complementarity problem
- An infeasible interior point algorithm for P₀-LCP based on algebraic transformation
- scientific article; zbMATH DE number 1326028 (Why is no real title available?)
- scientific article; zbMATH DE number 716152 (Why is no real title available?)
- scientific article; zbMATH DE number 1059237 (Why is no real title available?)
- scientific article; zbMATH DE number 1552029 (Why is no real title available?)
- scientific article; zbMATH DE number 2155136 (Why is no real title available?)
- scientific article; zbMATH DE number 1864507 (Why is no real title available?)
- scientific article; zbMATH DE number 2104098 (Why is no real title available?)
- An Interior-Point Differentiable Path-Following Method to Compute Stationary Equilibria in Stochastic Games
- An infeasible-start path-following method for monotone LCPs
- On the natural merit function for solving complementarity problems
- A two-step matrix splitting method for the mixed linear complementarity problem
- A Newton descent logarithmic barrier interior-point algorithm for monotone LCP
- New multiplier method for solving linear complementarity problems
- An adaptive interior-point method with backtracking line search for convex constrained optimization
- An adaptive infeasible interior-point algorithm for linear complementarity problems
- A self-adjusting interior point algorithm for linear complementarity problems
- An extension of interior point potential reduction algorithm to solve general lcps
This page was built for publication: An Infeasible-Interior-Point Method for Linear Complementarity Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4377574)
