An Infeasible-Interior-Point Method for Linear Complementarity Problems

DOI10.1137/S1052623495282882MaRDI QIDQ4377574zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

numerical resultsalgorithmcomputational performanceglobal convergenceinterior-point methodslinear complementaritylogarithmic-barrier method

Mathematics Subject Classification ID

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)

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

(29)

• scientific article; zbMATH DE number 1552029 (Why is no real title available?)
• An Interior-Point Differentiable Path-Following Method to Compute Stationary Equilibria in Stochastic Games
• A self-adjusting interior point algorithm for linear complementarity problems
• A limited memory quasi-Newton trust-region method for box constrained optimization
• An extension of interior point potential reduction algorithm to solve general lcps
• scientific article; zbMATH DE number 5606390 (Why is no real title available?)
• An infeasible interior proximal method for convex programming problems with linear constraints
• New multiplier method for solving linear complementarity problems
• A potential reduction method for tensor complementarity problems
• scientific article; zbMATH DE number 2104098 (Why is no real title available?)
• 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
• A finite improvement algorithm for the linear complementarity problem
• The complexity of self-regular proximity based infeasible IPMs
• An adaptive infeasible interior-point algorithm for linear complementarity problems
• A two-step matrix splitting method for the mixed linear complementarity problem
• scientific article; zbMATH DE number 1864507 (Why is no real title available?)
• On the natural merit function for solving complementarity problems
• An infeasible interior point algorithm for P₀-LCP based on algebraic transformation
• 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
• scientific article; zbMATH DE number 716152 (Why is no real title available?)
• Iterative descent method for generalized Leontief model
• scientific article; zbMATH DE number 2155136 (Why is no real title available?)
• 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)