Analysis of infeasible-interior-point paths arising with semidefinite linear complementarity problems

From MaRDI portal
Publication:1881047

DOI10.1007/s10107-003-0463-xzbMath1137.90682OpenAlexW2064462686MaRDI QIDQ1881047

Josef Stoer, Martin Preiß

Publication date: 27 September 2004

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-003-0463-x




Related Items (14)

On a special class of regularized central paths for semidefinite programsA limiting analysis on regularization of singular SDP and its implication to infeasible interior-point algorithmsOn the complexity of analyticity in semi-definite optimizationAsymptotic behavior of underlying NT paths in interior point methods for monotone semidefinite linear complementarity problemsAsymptotic behavior of helmberg-kojima-Monteiro (HKM) paths in interior-point methods for monotone semidefinite linear complementarity problems: General theoryAnalyticity of weighted central paths and error bounds for semidefinite programmingInterior point method on semi-definite linear complementarity problems using the Nesterov-Todd (NT) search direction: polynomial complexity and local convergenceAsymptotic behavior of the central path for a special class of degenerate SDP problemsLimiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programmingUnderlying paths in interior point methods for the monotone semidefinite linear complementarity problemComplementarity Problems Over Symmetric Cones: A Survey of Recent Developments in Several AspectsExploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel functionA potential reduction method for tensor complementarity problemsOn the analyticity of underlying HKM paths for monotone semidefinite linear complementarity problems




This page was built for publication: Analysis of infeasible-interior-point paths arising with semidefinite linear complementarity problems