On the identification of the optimal partition for semidefinite optimization
From MaRDI portal
(Redirected from Publication:5882391)
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
Cites work
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 1182578 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- A complementarity partition theorem for multifold conic systems
- A strongly polynomial rounding procedure yielding a maximally complementary solution for P_*() linear complementarity problems
- An exact duality theory for semidefinite programming and its complexity implications
- Analyticity of the central path at the boundary point in semidefinite programming
- Degeneracy in interior point methods for linear programming: A survey
- Error Bounds for Linear Matrix Inequalities
- Error bounds for analytic systems and their applications
- Extension of Hoffman’s Error Bound to Polynomial Systems
- Extension of Rotfel'd Theorem
- Foundations of Optimization
- Generalized Benders decomposition
- Initialization in semidefinite programming via a self-dual skew-symmetric embedding
- Interior Point Trajectories in Semidefinite Programming
- On parametric semidefinite programming
- On the Convergence of the Central Path in Semidefinite Optimization
- On the finite convergence of interior-point algorithms for linear programming
- On the identification of the optimal partition of second order cone optimization problems
- Perturbation analysis of second-order cone programming problems
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- Semidefinite Programming
- Some new bounds for singular values and eigenvalues of matrix products
- Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming
- Toward Probabilistic Analysis of Interior-Point Algorithms for Linear Programming
- Unifying optimal partition approach to sensitivity analysis in conic optimization
Cited in
(14)- 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 the identification of the optimal partition of second order cone optimization problems
- On Computing the Nonlinearity Interval in Parametric Semidefinite Optimization
- A rounding procedure for semidefinite optimization
- On the central path of semidefinite optimization: degree and worst-case convergence rate
- Basis- and partition identification for quadratic programming and linear complementarity problems
- Strict complementarity and non-degeneracy of solutions to copositive programming problems
- Error bounds and singularity degree in semidefinite programming
- 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)
