Complexity analysis of a full-Newton step interior-point method for monotone weighted linear complementarity problems

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

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
A smoothing Newton algorithm for weighted linear complementarity problem
Sufficient weighted complementarity problems
A polynomial interior-point algorithm for monotone linear complementarity problems
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 new primal-dual path-following interior-point algorithm for semidefinite optimization
A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
A full-Newton step infeasible interior-point algorithm based on darvay directions for linear optimization
Quadratic convergence analysis of a nonmonotone Levenberg-Marquardt type method for the weighted nonlinear complementarity problem
A nonmonotone smoothing Newton algorithm for weighted complementarity problem
A full-Newton step infeasible interior-point method for the special weighted linear complementarity problem
A full-modified-Newton step \(O(n)\) infeasible interior-point method for the special weighted linear complementarity problem
A full-Newton step interior-point method for monotone weighted linear complementarity problems
A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem
A new infeasible interior-point method based on Darvay's technique for symmetric optimization
Weighted Complementarity Problems---A New Paradigm for Computing Equilibria
A modified damped Gauss–Newton method for non-monotone weighted linear complementarity problems
Adaptive full newton-step infeasible interior-point method for sufficient horizontal LCP
Interior-point algorithms for a generalization of linear programming and weighted centring

This page was built for publication: Complexity analysis of a full-Newton step interior-point method for monotone weighted linear complementarity problems