An adaptive infeasible interior-point algorithm for linear complementarity problems
DOI10.1007/S40305-013-0031-XzbMATH Open1305.90396OpenAlexW1988419666MaRDI QIDQ743784FDOQ743784
Authors: Hossein Mansouri, M. Pirhaji 
Publication date: 30 September 2014
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40305-013-0031-x
Recommendations
- A new infeasible interior-point algorithm for linear complementarity problem
- A new infeasible interior-point method for linear complementarity problem based on full Newton step
- An Infeasible-Interior-Point Method for Linear Complementarity Problems
- An infeasible-interior-point algorithm for linear complementarity problems
- An infeasible interior-point algorithm for linear complementarity problem based on a kernel function
Interior-point methods (90C51) 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 complementary problems
- Self-regular functions and new search directions for linear and semidefinite optimization
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- Title not available (Why is that?)
- A new class of polynomial interior-point algorithms for \(P_*(\kappa)\)-linear complementary problems
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
- Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem
- Title not available (Why is that?)
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
- Feasibility issues in a primal-dual interior-point method for linear programming
- Test examples for nonlinear programming codes
- On a homogeneous algorithm for the monotone complementarity problem
- An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming
- Title not available (Why is that?)
- Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
- An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence
- Improved infeasible-interior-point algorithm for linear complementarity problerns
- Title not available (Why is that?)
- A polynomial interior-point algorithm for monotone linear complementarity problems
- A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points
- An adaptive infeasible interior-point algorithm with full-Newton step for linear optimization
Cited In (2)
This page was built for publication: An adaptive infeasible interior-point algorithm for linear complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q743784)
