Predictor-corrector interior-point algorithm for P_*()-linear complementarity problems based on a new type of algebraic equivalent transformation technique
From MaRDI portal
Publication:2076907
Recommendations
- Feasible corrector-predictor interior-point algorithm for \(P_* (\kappa)\)-linear complementarity problems based on a new search direction
- A predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems
- A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem
- A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem
- Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation
Cites work
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- scientific article; zbMATH DE number 6913928 (Why is no real title available?)
- scientific article; zbMATH DE number 1862745 (Why is no real title available?)
- scientific article; zbMATH DE number 3332061 (Why is no real title available?)
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP
- A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems
- A complementary variant of Lemke's method for the linear complementary problem
- A corrector-predictor interior-point method with new search direction for linear optimization
- A full-Newton step interior-point algorithm based on modified Newton direction
- A generalized direction in interior point method for monotone linear complementarity problems
- A new full-Newton step interior-point method for \(P_*(\kappa)\)-LCP based on a positive-asymptotic kernel function
- A new predictor-collector algorithm for linear programming
- A path to the Arrow-Debreu competitive market equilibrium
- A polynomial interior-point algorithm for monotone linear complementarity problems
- A polynomial path-following interior point algorithm for general linear complementarity problems
- A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem
- A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions
- A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Adaptive full Newton-step infeasible interior-point method for sufficient horizontal LCP
- An infeasible full-NT step IPM for \(P_\ast(\kappa)\) horizontal linear complementarity problem over Cartesian product of symmetric cones
- An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function
- 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
- Copositivity tests based on the linear complementarity problem
- Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
- Corrector‐Predictor Methods for Sufficient Linear Complementarity Problems in a Wide Neighborhood of the Central Path
- Criss-cross methods: A fresh view on pivot algorithms
- EP theorem for dual linear complementarity problems
- EP theorems and linear complementarity problems
- Engineering and Economic Applications of Complementarity Problems
- Equilibrium Points of Bimatrix Games
- Feasible corrector-predictor interior-point algorithm for \(P_* (\kappa)\)-linear complementarity problems based on a new search direction
- Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied
- Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier
- Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation
- Interior-point methods
- NP-completeness of the linear complementarity problem
- New criss-cross type algorithms for linear complementarity problems with sufficient matrices
- New interior point algorithms in linear programming
- New interior-point algorithm for symmetric optimization based on a positive-asymptotic barrier function
- New method for determining search directions for interior-point algorithms in linear optimization
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- On the Implementation of a Primal-Dual Interior Point Method
- On the complexity of computing the handicap of a sufficient matrix
- On the complexity of following the central path of linear programs by linear extrapolation. II
- On the interplay among entropy, variable metrics and potential functions in interior-point algorithms
- On the number of solutions to a class of linear complementarity problems
- Polynomial interior point algorithms for general linear complementarity problems
- Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
- Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
- Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path
- Primal-dual entropy-based interior-point algorithms for linear optimization
- Quitting games and linear complementarity problems
- Simplicial methods for quadratic programming
- Sufficient matrices and the linear complementarity problem
- The Simplex Method for Quadratic Programming
- The Symmetric Formulation of the Simplex Method for Quadratic Programming
- 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
- Unified analysis of kernel-based interior-point methods for \(P_*(\kappa)\)-linear complementarity problems
- \(P_ *\)-matrices are just sufficient
Cited in
(13)- A predictor-corrector algorithm for \(P_{\ast}(\kappa)\)-linear complementarity problems based on a specific self-regular proximity function
- Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation
- Interior-point algorithm for linear programming based on a new descent direction
- Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations
- An efficient primal-dual interior point algorithm for convex quadratic semidefinite optimization
- 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 predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems
- Corrector-predictor interior-point method with new search direction for semidefinite optimization
- New algorithm for \(P_*(k)\)-matrix linear complementarity problem based on algebraic transformation
- Feasible corrector-predictor interior-point algorithm for \(P_* (\kappa)\)-linear complementarity problems based on a new search direction
- Large-step predictor-corrector interior point method for sufficient linear complementarity problems based on the algebraic equivalent transformation
- A New full-newton step infeasible interior-point method for $$P_*(\kappa )$$-linear Complementarity problem
This page was built for publication: Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2076907)
