Analyticity of the central path at the boundary point in semidefinite programming
From MaRDI portal
Publication:1848384
DOI10.1016/S0377-2217(02)00276-XzbMath1058.90047OpenAlexW2049928456MaRDI QIDQ1848384
Publication date: 20 November 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00276-x
Related Items (12)
On the identification of the optimal partition for semidefinite optimization ⋮ On a special class of regularized central paths for semidefinite programs ⋮ Limiting behavior of the central path in semidefinite optimization ⋮ On the complexity of analyticity in semi-definite optimization ⋮ $LDL^T$ Direction Interior Point Method for Semidefinite Programming ⋮ Boosting the feasibility pump ⋮ Analyticity of weighted central paths and error bounds for semidefinite programming ⋮ Asymptotic behavior of the central path for a special class of degenerate SDP problems ⋮ 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 ⋮ On the Central Path of Semidefinite Optimization: Degree and Worst-Case Convergence Rate
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the analyticity properties of infeasible-interior point paths for monotone linear complementarity problems
- Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity
- Limiting behavior of weighted central paths in linear programming
- Initialization in semidefinite programming via a self-dual skew-symmetric embedding
- Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
- Analytical properties of the central path at boundary point in linear programming
- On weighted centers for semidefinite programming
- Uniform bounds on the limiting and marginal derivatives of the analytic center solution over a set of normalized weights
- Limiting behavior of the affine scaling continuous trajectories for linear programming problems
- A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for $P_*(\kappa)$ Linear Complementarity Problems
- Condition-Measure Bounds on the Behavior of the Central Trajectory of a Semidefinite Program
- On Two Interior-Point Mappings for Nonlinear Semidefinite Complementarity Problems
- High Order Infeasible-Interior-Point Methods for Solving Sufficient Linear Complementarity Problems
- Superlinear Convergence of an Algorithm for Monotone Linear Complementarity Problems, When No Strictly Complementary Solution Exists
- General Interior-Point Maps and Existence of Weighted Paths for Nonlinear Semidefinite Complementarity Problems
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- Interior Point Trajectories in Semidefinite Programming
- Limiting Behavior of the Derivatives of Certain Trajectories Associated with a Monotone Horizontal Linear Complementarity Problem
- Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming
- The analyticity of interior-point-paths at strictly complementary solutions of linear programs
- Error Bounds for Linear Matrix Inequalities
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Semidefinite Programming
- On sensitivity of central solutions in semidefinite programming
- Two simple proofs for analyticity of the central path in linear programming.
- \(Q\)-superlinear convergence of the iterates in primal-dual interior-point methods
This page was built for publication: Analyticity of the central path at the boundary point in semidefinite programming
