A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
From MaRDI portal
Publication:611277
DOI10.1016/j.nonrwa.2010.06.039zbMath1229.90236MaRDI QIDQ611277
Publication date: 14 December 2010
Published in: Nonlinear Analysis. Real World Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.nonrwa.2010.06.039
linear complementarity problems; polynomial complexity; infeasible interior-point method; feasible interior-point method
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
90C51: Interior-point methods
Related Items
Full Nesterov–Todd step feasible interior-point method for the CartesianP*(κ)-SCLCP, A new class of infeasible interior-point algorithm for linear complementarity problem, A path-following full Newton-step infeasible interior-point algorithm for \(P_*(\kappa)\)-HLCPs based on a kernel function, A polynomial interior-point algorithm for monotone linear complementarity problems, A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization, A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems, A full-Newton step infeasible interior-point algorithm for monotone LCP based on a locally-kernel function, A large-update interior-point method for Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones, A modified infeasible-interior-point algorithm for linear optimization problems, An adaptive infeasible interior-point algorithm for linear complementarity problems, A full-Newton step infeasible interior-point algorithm for \(P_\ast (\kappa)\) linear complementarity problem, Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems, An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function, A modified infeasible interior-point algorithm for P*(κ)-HLCP over symmetric cones, An infeasible interior-point algorithm based on modified Nesterov and Todd directions for symmetric linear complementarity problem, An infeasible interior-point method with improved centering steps for monotone linear complementarity problems
Cites Work
- Unnamed Item
- Unnamed Item
- A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization
- A new polynomial-time algorithm for linear programming
- Feasibility issues in a primal-dual interior-point method for linear programming
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- A primal-dual infeasible-interior-point algorithm for linear programming
- Polynomiality of infeasible-interior-point algorithms for linear programming
- A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points
- Self-regular functions and new search directions for linear and semidefinite optimization
- A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with \(O(\sqrt nL)\)-iteration complexity
- Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence
- An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence
- Homotopy Continuation Methods for Nonlinear Complementarity Problems
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming
- SimplifiedO(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
