The curvature integral and the complexity of linear complementarity problems
DOI10.1007/BF01585931zbMATH Open0841.90118OpenAlexW1976529189MaRDI QIDQ1904662FDOQ1904662
Publication date: 7 January 1996
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01585931
interior-point methodslinear complementarity problemcurvature integralcentral trajectorypredictor-corrector-type algorithm
Abstract computational complexity for mathematical programming problems (90C60) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- A path following algorithm for a class of convex programming problems
- Title not available (Why is that?)
- A polynomial-time algorithm for a class of linear complementarity problems
- On the complexity of following the central path of linear programs by linear extrapolation. II
- Estimating the complexity of a class of path-following methods for solving linear programs by curvature integrals
- A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
- Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence
- A polynomial method of approximate centers for linear programming
- Power Series Variants of Karmarkar-Type Algorithms
Cited In (3)
- Corrector-predictor methods for sufficient linear complementarity problems
- Asymptotic behavior of helmberg-kojima-Monteiro (HKM) paths in interior-point methods for monotone semidefinite linear complementarity problems: General theory
- Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem
Recommendations
- Complexity of Predictor-Corrector Algorithms for LCP Based on a Large Neighborhood of the Central Path 👍 👎
- On the Relationship Between the Curvature Integral and the Complexity of Path-Following Methods in Linear Programming 👍 👎
- A Mehrotra predictor-corrector algorithm for linear complementarity problem 👍 👎
- Estimating the complexity of a class of path-following methods for solving linear programs by curvature integrals 👍 👎
- Complexity of Mehrotra's predictor-corrector algorithms for monotone linear complementarity problems 👍 👎
This page was built for publication: The curvature integral and the complexity of linear complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1904662)
