Limiting behaviour and analyticity of weighted central paths in semidefinite programming

DOI10.1080/10556780903239493MaRDI QIDQ3562398zbMATH OpenOpenAlexFDO

Authors Margaréta Halická, Mária Trnovská

Publication date 21 May 2010

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10556780903239493

zbMATH Keywords

analyticityinterior-point methodssemidefinite programmingweighted central path

Mathematics Subject Classification ID

Semidefinite programming (90C22) Interior-point methods (90C51)

Recommendations

• 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
• Analyticity of weighted central paths and error bounds for semidefinite programming
• Analyticity of the central path at the boundary point in semidefinite programming
• Error Bounds and Limiting Behavior of Weighted Paths Associated with the SDP Map X1/2SX1/2

Cited in

(15)

• Analytical properties of the central path at boundary point in linear programming
• On weighted centers for semidefinite programming
• Analyticity of the central path at the boundary point in semidefinite programming
• Analysis of infeasible-interior-point paths arising with semidefinite linear complementarity problems
• Uniform bounds on the limiting and marginal derivatives of the analytic center solution over a set of normalized weights
• A strategy of global convergence for the affine scaling algorithm for convex semidefinite programming
• General interior-point maps and existence of weighted paths for nonlinear semidefinite complementarity problems.
• Limiting behavior and analyticity of two special types of infeasible weighted central paths in semidefinite programming
• Weighted central path in semidefinite programming associated with symmetrization map\newline (XS+SX)/2
• 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
• 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
• On a special class of regularized central paths for semidefinite programs
• Analyticity of weighted central paths and error bounds for semidefinite programming

This page was built for publication: Limiting behaviour and analyticity of weighted central paths in semidefinite programming

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