Publication:5309527
From MaRDI portal
zbMath1118.90308MaRDI QIDQ5309527
Publication date: 9 October 2007
90C05: Linear programming
Related Items
New Interior-Point Algorithm for Symmetric Optimization Based on a Positive-Asymptotic Barrier Function, Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction, A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions, New method for determining search directions for interior-point algorithms in linear optimization, Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation, Complexity analysis and numerical implementation of a short-step primal-dual algorithm for 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, 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 corrector-predictor interior-point method with new search direction for linear optimization, An infeasible primal-dual interior point algorithm for linear programs based on logarithmic equivalent transformation, A NEW POLYNOMIAL INTERIOR-POINT ALGORITHM FOR THE MONOTONE LINEAR COMPLEMENTARITY PROBLEM OVER SYMMETRIC CONES WITH FULL NT-STEPS