On the analyticity properties of infeasible-interior point paths for monotone linear complementarity problems
From MaRDI portal
Publication:1282365
DOI10.1007/s002110050407zbMath0916.90254OpenAlexW2025444228MaRDI QIDQ1282365
Publication date: 30 March 1999
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002110050407
Related Items (12)
On a special class of regularized central paths for semidefinite programs ⋮ Trajectory-following methods for large-scale degenerate convex quadratic programming ⋮ On the complexity of analyticity in semi-definite optimization ⋮ Asymptotic behavior of underlying NT paths in interior point methods for monotone semidefinite linear complementarity problems ⋮ Convergence of the homotopy path for a full-Newton step infeasible interior-point method ⋮ Asymptotic behavior of the central path for a special class of degenerate SDP problems ⋮ Two simple proofs for analyticity of the central path in linear programming. ⋮ Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming ⋮ Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem ⋮ A high-order path-following method for projection onto the primal-dual optimal solution set of linear programs ⋮ Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity ⋮ Analyticity of the central path at the boundary point in semidefinite programming
This page was built for publication: On the analyticity properties of infeasible-interior point paths for monotone linear complementarity problems