Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation

DOI10.1007/s11590-020-01612-0zbMath1466.90108OpenAlexW3037197978MaRDI QIDQ828652

Tibor Illés, Zsolt Darvay, Csilla Majoros

Publication date: 5 May 2021

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-020-01612-0

zbMATH Keywords

polynomial complexityinterior-point algorithmalgebraic equivalent transformationsufficient linear complementarity problem

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)

Related Items (7)

Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function ⋮ Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations ⋮ A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation ⋮ On sufficient properties of sufficient matrices ⋮ Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction ⋮ Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique ⋮ Stochastic numerical investigations for nonlinear three-species food chain system

Cites Work

• A new full-Newton step \(O(n)\) infeasible interior-point algorithm for \(P_\ast(\kappa)\)-horizontal linear complementarity problems
• A new primal-dual path-following method for convex quadratic programming
• On the complexity of computing the handicap of a sufficient matrix
• Determining the handicap of a sufficient matrix
• A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
• Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems
• A polynomial path-following interior point algorithm for general linear complementarity problems
• A new primal-dual path-following interior-point algorithm for semidefinite optimization
• Sufficient matrices and the linear complementarity problem
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• The linear complementarity problem, sufficient matrices, and the criss- cross method
• Criss-cross methods: A fresh view on pivot algorithms
• EP theorems and linear complementarity problems
• A path following interior-point method for linear complementarity problems over circular cones
• Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
• On a subclass of \(P_ 0\)
• \(P_ *\)-matrices are just sufficient
• A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
• A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem
• Polynomial 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
• Some generalizations of positive definiteness and monotonicity
• A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for $P_*(\kappa)$ Linear Complementarity Problems
• A NEW POLYNOMIAL INTERIOR-POINT ALGORITHM FOR THE MONOTONE LINEAR COMPLEMENTARITY PROBLEM OVER SYMMETRIC CONES WITH FULL NT-STEPS
• A Polynomial-time Interior-point Algorithm for Convex Quadratic Semidefinite Optimization
• On the Implementation of a Primal-Dual Interior Point Method
• Equivaence between different formulations of the linear complementarity promblem
• The s-monotone index selection rule for criss-cross algorithms of linear complementarity problems
• New criss-cross type algorithms for linear complementarity problems with sufficient matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation