scientific article; zbMATH DE number 5199040
From MaRDI portal
Publication:5309480
zbMath1118.90322MaRDI QIDQ5309480
Publication date: 9 October 2007
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items (18)
Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation ⋮ A logarithmic barrier approach for linear programming ⋮ A logarithmic barrier interior-point method based on majorant functions for second-order cone programming ⋮ Weighted-path-following interior-point algorithm to monotone mixed linear complementarity problem ⋮ Complexity analysis of a full-{N}ewton step interior-point method for linear optimization ⋮ A numerical study of an infeasible primal-dual path-following algorithm for linear programming ⋮ Interior-point algorithm for linear programming based on a new descent direction ⋮ A full-Newton step interior-point method for monotone weighted linear complementarity problems ⋮ A weighted-path-following method for symmetric cone linear complementarity problems ⋮ A generalized direction in interior point method for monotone linear complementarity problems ⋮ Primal interior-point decomposition algorithms for two-stage stochastic extended second-order cone programming ⋮ A full-Newton step feasible weighted primal-dual interior point algorithm for monotone LCP ⋮ Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems ⋮ Complexity analysis of a weighted-full-Newton step interior-point algorithm forP∗(κ)-LCP ⋮ A full Nesterov-Todd step feasible weighted primal-dual interior-point algorithm for symmetric optimization ⋮ A polynomial-time weighted path-following interior-point algorithm for linear optimization ⋮ The PMCGAOR and PMCSSOR methods for solving linear complementarity problems ⋮ Path-following interior-point algorithm for monotone linear complementarity problems
This page was built for publication:
