Analyticity of the central path at the boundary point in semidefinite programming
- 1 December 2002
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 143 (2) , 311-324
- https://doi.org/10.1016/s0377-2217(02)00276-x
Abstract
No abstract availableThis publication has 28 references indexed in Scilit:
- Two simple proofs for analyticity of the central path in linear programmingOperations Research Letters, 2001
- Uniform bounds on the limiting and marginal derivatives of the analytic center solution over a set of normalized weightsOperations Research Letters, 2000
- A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for $P_*(\kappa)$ Linear Complementarity ProblemsSIAM Journal on Optimization, 2000
- Analytical properties of the central path at boundary point in linear programmingMathematical Programming, 1999
- Interior Point Trajectories in Semidefinite ProgrammingSIAM Journal on Optimization, 1998
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical ResultsSIAM Journal on Optimization, 1998
- Initialization in semidefinite programming via a self-dual skew-symmetric embeddingOperations Research Letters, 1997
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial OptimizationSIAM Journal on Optimization, 1995
- Limiting behavior of weighted central paths in linear programmingMathematical Programming, 1994
- Limiting behavior of the affine scaling continuous trajectories for linear programming problemsMathematical Programming, 1991