Complexity of the primal–dual path-following algorithms for the weighted determinant maximization problems with linear matrix inequalities in the narrow neighbourhood
DOI10.1080/10556780701830048zbMATH Open1169.90013OpenAlexW1994924291MaRDI QIDQ3514846FDOQ3514846
Authors: Yu Xia 
Publication date: 23 July 2008
Published in: Optimization Methods \& Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780701830048
Recommendations
- Primal-dual path-following algorithms for determinant maximization problems with linear matrix inequalities
- Determinant Maximization with Linear Matrix Inequality Constraints
- On the complexity of following the central path of linear programs by linear extrapolation. II
- An extension of the standard polynomial-time primal-dual path-following algorithm to the weighted determination maximization problem with semidefinite contstraints
- Complexity analysis of primaldual algorithms for the semidefinite linear complementarity problem
complexitysemidefinite programminginterior-point methodpath-following algorithmweighted determinant maximization
Interior-point methods (90C51) Semidefinite programming (90C22) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Primal-dual path-following algorithms for determinant maximization problems with linear matrix inequalities
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- On a commutative class of search directions for linear programming over symmetric cones
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Determinant Maximization with Linear Matrix Inequality Constraints
- A Maximum Likelihood Approach to Density Estimation with Semidefinite Programming
- THE CENTRAL PATH IN SMOOTH CONVEX SEMIDEFINITE PROGRAMS
Cited In (2)
Uses Software
This page was built for publication: Complexity of the primal–dual path-following algorithms for the weighted determinant maximization problems with linear matrix inequalities in the narrow neighbourhood
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3514846)
