Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation
From MaRDI portal
(Redirected from Publication:828652)
Recommendations
- 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 algorithm for monotone LCP based on a modified Newton search direction
- An infeasible interior point algorithm for \(P_0\)-LCP based on algebraic transformation
- A path-following algorithm for solving linear complementarity problems based on algebraically equivalent transformations
- Feasible corrector-predictor interior-point algorithm for \(P_* (\kappa)\)-linear complementarity problems based on a new search direction
Cites work
- scientific article; zbMATH DE number 3972641 (Why is no real title available?)
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- scientific article; zbMATH DE number 4126998 (Why is no real title available?)
- scientific article; zbMATH DE number 1017028 (Why is no real title available?)
- scientific article; zbMATH DE number 1086734 (Why is no real title available?)
- scientific article; zbMATH DE number 3212891 (Why is no real title available?)
- A new algorithm for solving self-dual linear optimization problems
- A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
- A new full-Newton step \(O(n)\) infeasible interior-point algorithm for \(P_\ast(\kappa)\)-horizontal linear complementarity problems
- A new infeasible interior-point method based on Darvay's technique for symmetric optimization
- A new polynomial interior-point algorithm for the monotone linear complementarity problem over symmetric cones with full NT-steps
- A new primal-dual path-following interior-point algorithm for semidefinite optimization
- A new primal-dual path-following method for convex quadratic programming
- A path following interior-point method for linear complementarity problems over circular cones
- A polynomial path-following interior point algorithm for general linear complementarity problems
- A polynomial-time interior-point algorithm for convex quadratic semidefinite optimization
- A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem
- A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
- A strongly polynomial rounding procedure yielding a maximally complementary solution for \(P_*(\kappa)\) linear complementarity problems
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- A weighted-path-following method for linear optimization
- A weighted-path-following method for the linear complementarity problem
- Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems
- Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
- Criss-cross methods: A fresh view on pivot algorithms
- Determining the handicap of a sufficient matrix
- EP theorems and linear complementarity problems
- Equivaence between different formulations of the linear complementarity promblem
- New criss-cross type algorithms for linear complementarity problems with sufficient matrices
- New interior point algorithms in linear programming
- On a subclass of \(P_ 0\)
- On the Implementation of a Primal-Dual Interior Point Method
- On the complexity of computing the handicap of a sufficient matrix
- Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
- Some generalizations of positive definiteness and monotonicity
- Sufficient matrices and the linear complementarity problem
- The linear complementarity problem, sufficient matrices, and the criss- cross method
- The s-monotone index selection rule for criss-cross algorithms of linear complementarity problems
- \(P_ *\)-matrices are just sufficient
Cited in
(15)- Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique
- Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations
- A path-following algorithm for solving linear complementarity problems based on algebraically equivalent transformations
- On sufficient properties of sufficient matrices
- Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function
- Large-step predictor-corrector interior point method for sufficient linear complementarity problems based on the algebraic equivalent transformation
- Feasible corrector-predictor interior-point algorithm for \(P_* (\kappa)\)-linear complementarity problems based on a new search direction
- Stochastic numerical investigations for nonlinear three-species food chain system
- A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation
- A path-following interior-point algorithm for monotone LCP based on a modified Newton search direction
- A new Ai-Zhang type interior point algorithm for sufficient linear complementarity problems
- New predictor-corrector algorithm for symmetric cone horizontal linear complementarity problems
- Sufficient matrices: properties, generating and testing
- Unified approach of interior-point algorithms for \(P_* (\kappa)\)-LCPs using a new class of algebraically equivalent transformations
- A class of wide neighborhood interior-point algorithms based on the algebraic equivalent transformation technique with specific functions
This page was built for publication: Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q828652)
