An Infeasible-Interior-Point Method for Linear Complementarity Problems
DOI10.1137/S1052623495282882zbMATH Open0913.65056OpenAlexW2038257044MaRDI QIDQ4377574FDOQ4377574
Authors: Evangelia Simantiraki, David F. Shanno 
Publication date: 10 February 1998
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623495282882
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
numerical resultsalgorithmcomputational performanceglobal convergenceinterior-point methodslinear complementaritylogarithmic-barrier method
Numerical mathematical programming methods (65K05) Complexity and performance of numerical algorithms (65Y20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cited In (29)
- Title not available (Why is that?)
- An Interior-Point Differentiable Path-Following Method to Compute Stationary Equilibria in Stochastic Games
- A self-adjusting interior point algorithm for linear complementarity problems
- Title not available (Why is that?)
- An extension of interior point potential reduction algorithm to solve general lcps
- A limited memory quasi-Newton trust-region method for box constrained optimization
- An infeasible interior proximal method for convex programming problems with linear constraints
- A potential reduction method for tensor complementarity problems
- New multiplier method for solving linear complementarity problems
- Title not available (Why is that?)
- Newton-type interior-point methods for solving generalized complementarity problems in polyhedral cones
- An infeasible interior point method for the monotone linear complementarity problem
- An infeasible-start path-following method for monotone LCPs
- The complexity of self-regular proximity based infeasible IPMs
- A finite improvement algorithm for the linear complementarity problem
- A two-step matrix splitting method for the mixed linear complementarity problem
- An adaptive infeasible interior-point algorithm for linear complementarity problems
- Title not available (Why is that?)
- An infeasible interior point algorithm for \(P_0\)-LCP based on algebraic transformation
- On the natural merit function for solving complementarity problems
- An efficient implementation of a trust region method for box constrained optimization
- AN O(n^3L) ALGORITHM USING A SEQUENCE FOR A LINEAR COMPLEMENTARITY PROBLEM
- Title not available (Why is that?)
- Iterative descent method for generalized Leontief model
- Title not available (Why is that?)
- Interior hybrid proximal extragradient methods for the linear monotone complementarity problem
- An arc-search infeasible interior-point algorithm for horizontal linear complementarity problem in the N∞− neighbourhood of the central path
- A Newton descent logarithmic barrier interior-point algorithm for monotone LCP
- Global convergence enhancement of classical linesearch interior point methods for MCPs
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)
