A path-following interior-point algorithm for linear and quadratic problems
From MaRDI portal
Publication:1915907
DOI10.1007/BF02206813zbMath0848.90114OpenAlexW2571013927MaRDI QIDQ1915907
Publication date: 9 October 1996
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02206813
convex quadratic programmingmonotone linear complementarity\(Q\)-subquadratic convergencepath-following interior-point methods
Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
A bottom-up biofuel market equilibrium model for policy analysis, Generalized System Identification with Stable Spline Kernels, A superquadratic infeasible-interior-point method for linear complementarity problems, A New Stopping Criterion for Krylov Solvers Applied in Interior Point Methods, An improved predictor-corrector interior-point algorithm for linear complementarity problems with \(O(\sqrt{n}L)\)-iteration complexity, Equivaence between different formulations of the linear complementarity promblem, The sign-based methods for solving a class of nonlinear complementarity problems, A primal-dual interior-point algorithm for quadratic programming, A non-modulus linear method for solving the linear complementarity problem
Cites Work
- Error bounds for nondegenerate monotone linear complementarity problems
- Monotone (nonlinear) operators in Hilbert space
- On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
- Local convergence of interior-point algorithms for degenerate monotone LCP
- An infeasible-interior-point algorithm for linear complementarity problems
- Superlinear primal-dual affine scaling algorithms for LCP
- 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
- Generalized Linear Complementarity Problems
- An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming