On the analyticity of underlying HKM paths for monotone semidefinite linear complementarity problems
From MaRDI portal
Publication:1029277
DOI10.1007/s10957-008-9480-5zbMath1175.90388OpenAlexW1987764373WikidataQ58028370 ScholiaQ58028370MaRDI QIDQ1029277
Publication date: 10 July 2009
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-008-9480-5
Semidefinite programming (90C22) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items
Asymptotic behavior of underlying NT paths in interior point methods for monotone semidefinite linear complementarity problems ⋮ Interior point method on semi-definite linear complementarity problems using the Nesterov-Todd (NT) search direction: polynomial complexity and local convergence ⋮ Complementarity Problems Over Symmetric Cones: A Survey of Recent Developments in Several Aspects
Cites Work
- Unnamed Item
- Unnamed Item
- Asymptotic behavior of helmberg-kojima-Monteiro (HKM) paths in interior-point methods for monotone semidefinite linear complementarity problems: General theory
- Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem
- On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
- Analysis of infeasible-interior-point paths arising with semidefinite linear complementarity problems
- A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
- Asymptotic behavior of the central path for a special class of degenerate SDP problems
- Superlinear Convergence of an Algorithm for Monotone Linear Complementarity Problems, When No Strictly Complementary Solution Exists
- Quadratic Convergence in a Primal-Dual Method
- The Nonlinear Geometry of Linear Programming. III Projective Legendre Transform Coordinates and Hilbert Geometry
- The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
- The Nonlinear Geometry of Linear Programming. II Legendre Transform Coordinates and Central Trajectories
- On the Nesterov--Todd Direction in Semidefinite Programming
- Error Bounds and Limiting Behavior of Weighted Paths Associated with the SDP Map X1/2SX1/2
- Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming
