A polynomial interior-point algorithm for monotone linear complementarity problems
From MaRDI portal
Publication:353166
DOI10.1007/S10957-012-0195-2zbMATH Open1267.90155OpenAlexW1980977181MaRDI QIDQ353166FDOQ353166
Authors: H. Mansouri, M. Pirhaji 
Publication date: 12 July 2013
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-012-0195-2
Recommendations
- An interior point method for solving monotone linear complementarity problem
- A generalized direction in interior point method for monotone linear complementarity problems
- A new polynomial interior-point algorithm for the monotone linear complementarity problem over symmetric cones with full NT-steps
- A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
- Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
polynomial complexitycentral pathfeasible interior-point methodmonotone linear complementarity problem (MLCP)
Interior-point methods (90C51) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- A new polynomial-time algorithm for linear programming
- A unified approach to interior point algorithms for linear complementary problems
- Self-regular functions and new search directions for linear and semidefinite optimization
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- Title not available (Why is that?)
- Corrector-predictor methods for sufficient linear complementarity problems
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
- On a class of superlinearly convergent polynomial time interior point methods for sufficient LCP
- An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
- A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
- Test examples for nonlinear programming codes
- New interior point algorithms in 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?)
- SimplifiedO(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps
Cited In (25)
- An infeasible full-NT step IPM for \(P_\ast(\kappa)\) horizontal linear complementarity problem over Cartesian product of symmetric cones
- A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem
- A new polynomial interior-point algorithm for the monotone linear complementarity problem over symmetric cones with full NT-steps
- A path following interior-point method for linear complementarity problems over circular cones
- Complexity analysis of a full-Newton step interior-point method for monotone weighted linear complementarity problems
- Unified approach of interior-point algorithms for \(P_* (\kappa)\)-LCPs using a new class of algebraically equivalent transformations
- New method for determining search directions for interior-point algorithms in linear optimization
- A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions
- New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP
- A path-following interior-point algorithm for monotone LCP based on a modified Newton search direction
- An interior point method for solving monotone linear complementarity problem
- A new path-following interior-point algorithm for monotone semidefinite linear complementarity problems
- Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function
- Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique
- A polynomial path-following interior point algorithm for general linear complementarity problems
- An adaptive infeasible interior-point algorithm for linear complementarity problems
- Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
- A full-Newton step infeasible interior-point algorithm based on darvay directions for linear optimization
- Feasible corrector-predictor interior-point algorithm for \(P_* (\kappa)\)-linear complementarity problems based on a new search direction
- An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function
- Title not available (Why is that?)
- Title not available (Why is that?)
- A full-NT step infeasible interior-point algorithm for mixed symmetric cone LCPs
- New interior-point algorithm for symmetric optimization based on a positive-asymptotic barrier function
- A wide-neighborhood predictor-corrector interior-point algorithm for linear complementarity problems
This page was built for publication: A polynomial interior-point algorithm for monotone linear complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q353166)
