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

DOI10.1007/S10107-003-0463-XMaRDI QIDQ1881047zbMATH OpenOpenAlexFDO

Authors Martin Preiß, Josef Stoer

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

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Interior-point methods (90C51) Semidefinite programming (90C22) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• scientific article; zbMATH DE number 2158989
• Limiting behaviour and analyticity of weighted central paths in semidefinite programming
• Limiting behavior and analyticity of two special types of infeasible weighted central paths in semidefinite programming
• Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming
• On the analyticity properties of infeasible-interior point paths for monotone linear complementarity problems

Cited in

(17)

• scientific article; zbMATH DE number 2158989 (Why is no real title available?)
• Infeasible/feasible search trajectories and directional rounding in integer programming
• Asymptotic behavior of underlying NT paths in interior point methods for monotone semidefinite linear complementarity problems
• Asymptotic behavior of helmberg-kojima-Monteiro (HKM) paths in interior-point methods for monotone semidefinite linear complementarity problems: General theory
• Analyticity of weighted central paths and error bounds for semidefinite programming
• A limiting analysis on regularization of singular SDP and its implication to infeasible interior-point algorithms
• Asymptotic behavior of the central path for a special class of degenerate SDP problems
• A potential reduction method for tensor complementarity problems
• Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem
• On a special class of regularized central paths for semidefinite programs
• Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function
• General interior-point maps and existence of weighted paths for nonlinear semidefinite complementarity problems.
• On the analyticity of underlying HKM paths for monotone semidefinite linear complementarity problems
• Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming
• 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
• On the complexity of analyticity in semi-definite optimization

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1881047)