A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems
From MaRDI portal
Publication:1913863
DOI10.1007/BF01204707zbMath0846.90112MaRDI QIDQ1913863
Josef Stoer, Shinji Mizuno, Florian Jarre
Publication date: 2 June 1996
Published in: Applied Mathematics and Optimization (Search for Journal in Brave)
Quadratic programming (90C20) Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (6)
On homogeneous and self-dual algorithms for LCP ⋮ Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points ⋮ Equivaence between different formulations of the linear complementarity promblem ⋮ Path-following barrier and penalty methods for linearly constrained problems ⋮ Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity ⋮ Perturbed path following predictor-corrector interior point algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- A little theorem of the big \({\mathcal M}\) in interior point algorithms
- A new polynomial-time algorithm for linear programming
- Feasibility issues in a primal-dual interior-point method for linear programming
- Computational experience with a primal-dual interior point method for linear programming
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- A polynomial-time algorithm for a class of linear complementarity problems
- A primal-dual infeasible-interior-point algorithm for linear programming
- On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
- An infeasible-interior-point algorithm for linear complementarity problems
- Polynomiality of infeasible-interior-point algorithms for linear programming
- A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points
- An infeasible-interior-point algorithm using projections onto a convex set
- A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
- Quadratic Convergence in a Primal-Dual Method
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
- Generalized Linear Complementarity Problems
- Two Infeasible Interior-Point Predictor-Corrector Algorithms for Linear Programming
- Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems
This page was built for publication: A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems
