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

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

Cites Work

On the Implementation of a Primal-Dual Interior Point Method
A unified approach to interior point algorithms for linear complementarity problems: A summary
$P_ *$-matrices are just sufficient
A predictor-corrector interior-point algorithm for $P_\ast (\kappa )$-horizontal linear complementarity problem
Title not available (Why is that?)
Title not available (Why is that?)
A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
Title not available (Why is that?)
A new full-Newton step $O(n)$ infeasible interior-point algorithm for $P_\ast(\kappa)$-horizontal linear complementarity problems
The linear complementarity problem, sufficient matrices, and the criss- cross method
Some generalizations of positive definiteness and monotonicity
A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
Title not available (Why is that?)
Sufficient matrices and the linear complementarity problem
On a subclass of $P_ 0$
A strongly polynomial rounding procedure yielding a maximally complementary solution for $P_*(\kappa)$ linear complementarity problems
Equivaence between different formulations of the linear complementarity promblem
On the complexity of computing the handicap of a sufficient matrix
A polynomial path-following interior point algorithm for general linear complementarity problems
Polynomial interior-point algorithm for $P_\ast(\kappa)$ horizontal linear complementarity problems
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
A new primal-dual path-following method for convex quadratic programming
Criss-cross methods: A fresh view on pivot algorithms
A Polynomial-time Interior-point Algorithm for Convex Quadratic Semidefinite Optimization
Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems
A new polynomial interior-point algorithm for the monotone linear complementarity problem over symmetric cones with full NT-steps
EP theorems and linear complementarity problems
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
A new infeasible interior-point method based on Darvay's technique for symmetric optimization
A new primal-dual path-following interior-point algorithm for semidefinite optimization
Determining the handicap of a sufficient matrix
Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
Title not available (Why is that?)
A path following interior-point method for linear complementarity problems over circular cones
Title not available (Why is that?)

Cited In (13)

Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations
Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New 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 path-following interior-point algorithm for monotone LCP based on a modified Newton search direction
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
Stochastic numerical investigations for nonlinear three-species food chain system
On sufficient properties of sufficient matrices
Large-step predictor-corrector interior point method for sufficient linear complementarity problems based on the algebraic equivalent transformation
A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation

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)