A polynomial interior-point algorithm for monotone linear complementarity problems
From MaRDI portal
(Redirected from Publication:353166)
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
Cites work
- scientific article; zbMATH DE number 4147426 (Why is no real title available?)
- scientific article; zbMATH DE number 1862745 (Why is no real title available?)
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
- A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
- A new polynomial-time algorithm for linear programming
- A unified approach to interior point algorithms for linear complementary problems
- An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
- An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence
- Corrector-predictor methods for sufficient linear complementarity problems
- Improved infeasible-interior-point algorithm for linear complementarity problerns
- New interior point algorithms in linear programming
- On a class of superlinearly convergent polynomial time interior point methods for sufficient LCP
- Self-regular functions and new search directions for linear and semidefinite optimization
- SimplifiedO(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps
- Test examples for nonlinear programming codes
Cited in
(25)- New interior-point algorithm for symmetric optimization 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 path following interior-point method for linear complementarity problems over circular cones
- An infeasible full-NT step IPM for \(P_\ast(\kappa)\) horizontal linear complementarity problem over Cartesian product of symmetric cones
- An interior point method for solving monotone linear complementarity problem
- A polynomial path-following interior point algorithm for general linear complementarity problems
- A new path-following interior-point algorithm for monotone semidefinite linear complementarity problems
- A full-Newton step infeasible interior-point algorithm based on darvay directions for linear optimization
- Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function
- scientific article; zbMATH DE number 6402146 (Why is no real title available?)
- Feasible corrector-predictor interior-point algorithm for \(P_* (\kappa)\)-linear complementarity problems based on a new search direction
- A wide-neighborhood predictor-corrector interior-point algorithm for linear complementarity problems
- New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP
- An adaptive infeasible interior-point algorithm for linear complementarity problems
- A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem
- An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function
- A path-following interior-point algorithm for monotone LCP based on a modified Newton search direction
- New method for determining search directions for interior-point algorithms in linear optimization
- 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
- scientific article; zbMATH DE number 6847407 (Why is no real title available?)
- Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
- A full-NT step infeasible interior-point algorithm for mixed symmetric cone LCPs
- A new polynomial interior-point algorithm for the monotone linear complementarity problem over symmetric cones with full NT-steps
- A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions
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)
