Asymptotic behavior of helmberg-kojima-Monteiro (HKM) paths in interior-point methods for monotone semidefinite linear complementarity problems: General theory
type: Item
instance of: scholarly article
title: Asymptotic behavior of helmberg-kojima-Monteiro (HKM) paths in interior-point methods for monotone semidefinite linear complementarity problems: General theory
zbMATH Open document ID: 1144.90494
published in: Journal of Optimization Theory and Applications
publication date: 2008-06-04T00:00:00Z
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 90C51
Mathematics Subject Classification ID: 90C22
zbMATH DE Number: 5284723
zbMATH Keywords: Semidefinite linear complementarity problems
zbMATH Keywords: Ordinary differential equations
zbMATH Keywords: Off-central paths
zbMATH Keywords: HKM direction
zbMATH Keywords: Analyticity
Wikidata QID: Q58028372
author: Chee-Khian Sim
author: Gongyun Zhao
MaRDI profile type: Publication
full work available at URL: s10957-007-9280-3
OpenAlex ID: W2000113695
cites work: The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
cites work: The Nonlinear Geometry of Linear Programming. II Legendre Transform Coordinates and Central Trajectories
cites work: The Nonlinear Geometry of Linear Programming. III Projective Legendre Transform Coordinates and Hilbert Geometry
cites work: On the complexity of following the central path of linear programs by linear extrapolation. II
cites work: Estimating the complexity of a class of path-following methods for solving linear programs by curvature integrals
cites work: On the Relationship Between the Curvature Integral and the Complexity of Path-Following Methods in Linear Programming
cites work: The curvature integral and the complexity of linear complementarity problems
cites work: A primal-dual interior point method whose running time depends only on the constraint matrix
cites work: Quadratic Convergence in a Primal-Dual Method
cites work: On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
cites work: A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
cites work: Superlinear convergence of an algorithm for monotone linear complementarity problems, when no strictly complementary solution exists
cites work: Error Bounds and Limiting Behavior of Weighted Paths Associated with the SDP Map X1/2SX1/2
cites work: Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming
cites work: Analysis of infeasible-interior-point paths arising with semidefinite linear complementarity problems
cites work: Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem
cites work: Asymptotic behavior of the central path for a special class of degenerate SDP problems
cites work: On the Nesterov--Todd Direction in Semidefinite Programming
cites work: On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
cites work: On the Convergence of the Central Path in Semidefinite Optimization
cites work: High order infeasible-interior-point methods for solving sufficient linear complementarity problems
cites work: On the rate of local convergence of high-order-infeasible-path-following algorithms for \(P_*\)-linear complementarity problems
DOI: 10.1007/S10957-007-9280-3
description: scientific article; zbMATH DE number 5284723