On the identification of the optimal partition for semidefinite optimization
From MaRDI portal
Publication:5882391
DOI10.1080/03155986.2019.1572853OpenAlexW2922117705WikidataQ128268066 ScholiaQ128268066MaRDI QIDQ5882391
Tamás Terlaky, Ali Mohammad Nezhad
Publication date: 15 March 2023
Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03155986.2019.1572853
optimal partitionsemidefinite optimizationdegree of singularitymaximally complementary optimal solution
Related Items
On the complexity of analyticity in semi-definite optimization, On the sensitivity of the optimal partition for parametric second-order conic optimization, Quadratic convergence to the optimal solution of second-order conic optimization without strict complementarity, Error Bounds and Singularity Degree in Semidefinite Programming, On the Central Path of Semidefinite Optimization: Degree and Worst-Case Convergence Rate, On Computing the Nonlinearity Interval in Parametric Semidefinite Optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extension of Rotfel'd Theorem
- On the finite convergence of interior-point algorithms for linear programming
- Unifying optimal partition approach to sensitivity analysis in conic optimization
- On parametric semidefinite programming
- Degeneracy in interior point methods for linear programming: A survey
- Error bounds for analytic systems and their applications
- Initialization in semidefinite programming via a self-dual skew-symmetric embedding
- An exact duality theory for semidefinite programming and its complexity implications
- Analyticity of the central path at the boundary point in semidefinite programming
- A complementarity partition theorem for multifold conic systems
- Generalized Benders decomposition
- Perturbation analysis of second-order cone programming problems
- A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for $P_*(\kappa)$ Linear Complementarity Problems
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- Interior Point Trajectories in Semidefinite Programming
- Toward Probabilistic Analysis of Interior-Point Algorithms for Linear Programming
- Extension of Hoffman’s Error Bound to Polynomial Systems
- Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming
- Error Bounds for Linear Matrix Inequalities
- On the Convergence of the Central Path in Semidefinite Optimization
- Semidefinite Programming
- On the Identification of the Optimal Partition of Second Order Cone Optimization Problems
- Foundations of Optimization
- Some new bounds for singular values and eigenvalues of matrix products
