scientific article; zbMATH DE number 5199081

From MaRDI portal
Revision as of 22:12, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5309527

zbMath1118.90308MaRDI QIDQ5309527

Zsolt Darvay

Publication date: 9 October 2007


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (14)

Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformationA path following interior-point method for linear complementarity problems over circular conesA NEW POLYNOMIAL INTERIOR-POINT ALGORITHM FOR THE MONOTONE LINEAR COMPLEMENTARITY PROBLEM OVER SYMMETRIC CONES WITH FULL NT-STEPSComplexity analysis of a full-{N}ewton step interior-point method for linear optimizationA corrector-predictor interior-point method with new search direction for linear optimizationNew Interior-Point Algorithm for Symmetric Optimization Based on a Positive-Asymptotic Barrier FunctionA generalized direction in interior point method for monotone linear complementarity problemsA primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directionsComplexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problemsLarge-step predictor-corrector interior point method for sufficient linear complementarity problems based on the algebraic equivalent transformationNew method for determining search directions for interior-point algorithms in linear optimizationA new full-Newton step interior-point method for \(P_*(\kappa)\)-LCP based on a positive-asymptotic kernel functionFeasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search DirectionAn infeasible primal-dual interior point algorithm for linear programs based on logarithmic equivalent transformation







This page was built for publication: