On the identification of the optimal partition for semidefinite optimization
From MaRDI portal
Publication:5882391
DOI10.1080/03155986.2019.1572853OpenAlexW2922117705WikidataQ128268066 ScholiaQ128268066MaRDI QIDQ5882391FDOQ5882391
Authors: Ali Mohammad Nezhad, Tamás Terlaky 
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
Recommendations
- A rounding procedure for semidefinite optimization
- On the identification of the optimal partition of second order cone optimization problems
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Finding an interior point in the optimal face of linear programs
- scientific article; zbMATH DE number 2088028
semidefinite optimizationoptimal partitiondegree of singularitymaximally complementary optimal solution
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Semidefinite Programming
- Title not available (Why is that?)
- Degeneracy in interior point methods for linear programming: A survey
- Error bounds for analytic systems and their applications
- An exact duality theory for semidefinite programming and its complexity implications
- Generalized Benders decomposition
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- Extension of Hoffman’s Error Bound to Polynomial Systems
- Error Bounds for Linear Matrix Inequalities
- On the finite convergence of interior-point algorithms for linear programming
- A strongly polynomial rounding procedure yielding a maximally complementary solution for \(P_*(\kappa)\) linear complementarity problems
- Perturbation analysis of second-order cone programming problems
- Foundations of Optimization
- Some new bounds for singular values and eigenvalues of matrix products
- On the Convergence of the Central Path in Semidefinite Optimization
- Initialization in semidefinite programming via a self-dual skew-symmetric embedding
- Title not available (Why is that?)
- Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming
- Analyticity of the central path at the boundary point in semidefinite programming
- Interior Point Trajectories in Semidefinite Programming
- On the Identification of the Optimal Partition of Second Order Cone Optimization Problems
- Unifying optimal partition approach to sensitivity analysis in conic optimization
- Extension of Rotfel'd Theorem
- On parametric semidefinite programming
- Toward Probabilistic Analysis of Interior-Point Algorithms for Linear Programming
- A complementarity partition theorem for multifold conic systems
Cited In (11)
- On the Central Path of Semidefinite Optimization: Degree and Worst-Case Convergence Rate
- On the sensitivity of the optimal partition for parametric second-order conic optimization
- Finding an interior point in the optimal face of linear programs
- On Computing the Nonlinearity Interval in Parametric Semidefinite Optimization
- Error Bounds and Singularity Degree in Semidefinite Programming
- Basis- and partition identification for quadratic programming and linear complementarity problems
- Generating linear, semidefinite, and second-order cone optimization problems for numerical experiments
- Quadratic convergence to the optimal solution of second-order conic optimization without strict complementarity
- Identifying the optimal partition in convex quadratic programming
- Partition-Optimization with Schur Convex Sum Objective Functions
- On the complexity of analyticity in semi-definite optimization
This page was built for publication: On the identification of the optimal partition for semidefinite optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5882391)
