A polynomial time constraint-reduced algorithm for semidefinite optimization problems
From MaRDI portal
Publication:493064
DOI10.1007/s10957-015-0714-zzbMath1329.90104OpenAlexW2018204628MaRDI QIDQ493064
Sungwoo Park, Dianne P. O'Leary
Publication date: 11 September 2015
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-015-0714-z
semidefinite programminginterior point methodspolynomial complexityconstraint reductionprimal dual infeasible
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Interior-point methods (90C51)
Related Items (3)
A constraint-reduced algorithm for semidefinite optimization problems with superlinear convergence ⋮ A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme ⋮ A polynomial time constraint-reduced algorithm for semidefinite optimization problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A constraint-reduced variant of Mehrotra's predictor-corrector algorithm
- Adaptive constraint reduction for convex quadratic programming
- A polynomial time constraint-reduced algorithm for semidefinite optimization problems
- An active-set strategy in an interior point method for linear programming
- Adaptive constraint reduction for training support vector machines
- Superlinear convergence of interior-point algorithms for semidefinite programming
- A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
- Interior point techniques in optimization. Complementarity, sensitivity and algorithms
- Exploiting sparsity in primal-dual interior-point methods for semidefinite programming
- Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
- Semidefinite programming relaxations for the quadratic assignment problem
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- Condition Estimates
- New upper bounds for kissing numbers from semidefinite programming
- On Semidefinite Programming Relaxations of the Traveling Salesman Problem
- A Survey of Condition Number Estimation for Triangular Matrices
- The Efficient Generation of Random Orthogonal Matrices with an Application to Condition Estimators
- A comparison of the Delsarte and Lovász bounds
- Estimating Matrix Condition Numbers
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- Polynomial Convergence of Primal-Dual Algorithms for Semidefinite Programming Based on the Monteiro and Zhang Family of Directions
- A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming
- A Short-Cut Potential Reduction Algorithm for Linear Programming
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
- A Predictor-Corrector Interior-Point Algorithm for the Semidefinite Linear Complementarity Problem Using the Alizadeh--Haeberly--Overton Search Direction
- Methods for Modifying Matrix Factorizations
- An Interior-Point Method for Semidefinite Programming
- On the Local Convergence of a Predictor-Corrector Method for Semidefinite Programming
- Constraint Reduction for Linear Programs with Many Inequality Constraints
This page was built for publication: A polynomial time constraint-reduced algorithm for semidefinite optimization problems
