A polynomial time constraint-reduced algorithm for semidefinite optimization problems
From MaRDI portal
Recommendations
- A constraint-reduced algorithm for semidefinite optimization problems with superlinear convergence
- A polynomial-time interior-point algorithm for convex quadratic semidefinite optimization
- A class of polynomial primal-dual interior-point algorithms for semidefinite optimization
- Infeasible interior point method for semidefinite programs
- Infeasible potential reduction algorithms for semidefinite programming
Cites work
- scientific article; zbMATH DE number 3748409 (Why is no real title available?)
- scientific article; zbMATH DE number 741122 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 776084 (Why is no real title available?)
- A Predictor-Corrector Interior-Point Algorithm for the Semidefinite Linear Complementarity Problem Using the Alizadeh--Haeberly--Overton Search Direction
- A Short-Cut Potential Reduction Algorithm for Linear Programming
- A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming
- A Survey of Condition Number Estimation for Triangular Matrices
- A comparison of the Delsarte and Lovász bounds
- A constraint-reduced variant of Mehrotra's predictor-corrector algorithm
- A polynomial time constraint-reduced algorithm for semidefinite optimization problems
- A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
- Adaptive constraint reduction for convex quadratic programming
- Adaptive constraint reduction for training support vector machines
- An Interior-Point Method for Semidefinite Programming
- An active-set strategy in an interior point method for linear programming
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Condition Estimates
- Constraint Reduction for Linear Programs with Many Inequality Constraints
- Estimating Matrix Condition Numbers
- Exploiting sparsity in primal-dual interior-point methods for semidefinite programming
- Interior point techniques in optimization. Complementarity, sensitivity and algorithms
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
- Methods for Modifying Matrix Factorizations
- New upper bounds for kissing numbers from semidefinite programming
- On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
- On Semidefinite Programming Relaxations of the Traveling Salesman Problem
- On the Local Convergence of a Predictor-Corrector Method for Semidefinite Programming
- On the implementation and usage of SDPT3 -- a Matlab software package for semidefinite-quadratic-linear programming, version 4.0
- Polynomial Convergence of Primal-Dual Algorithms for Semidefinite Programming Based on the Monteiro and Zhang Family of Directions
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Semidefinite programming relaxations for the quadratic assignment problem
- Superlinear convergence of a predictor-corrector method for semidefinite programming without shrinking central path neighborhood
- Superlinear convergence of interior-point algorithms for semidefinite programming
- The Efficient Generation of Random Orthogonal Matrices with an Application to Condition Estimators
Cited in
(5)- An algorithm for semi-infinite polynomial optimization
- Role of redundant constraints for improving dual bounds in polynomial optimization problems
- A constraint-reduced algorithm for semidefinite optimization problems with superlinear convergence
- A polynomial time constraint-reduced algorithm for semidefinite optimization problems
- A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme
This page was built for publication: A polynomial time constraint-reduced algorithm for semidefinite optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q493064)
