Complexity of the primal–dual path-following algorithms for the weighted determinant maximization problems with linear matrix inequalities in the narrow neighbourhood

DOI10.1080/10556780701830048zbMath1169.90013OpenAlexW1994924291MaRDI QIDQ3514846

Yu Xia

Publication date: 23 July 2008

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556780701830048

zbMATH Keywords

complexitysemidefinite programminginterior-point methodpath-following algorithmweighted determinant maximization

Mathematics Subject Classification ID

Semidefinite programming (90C22) Abstract computational complexity for mathematical programming problems (90C60) Interior-point methods (90C51)

Uses Software

• SDPA

Cites Work

• On a commutative class of search directions for linear programming over symmetric cones
• Primal-dual path-following algorithms for determinant maximization problems with linear matrix inequalities
• A Maximum Likelihood Approach to Density Estimation with Semidefinite Programming
• Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
• On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
• Self-Scaled Barriers and Interior-Point Methods for Convex Programming
• Determinant Maximization with Linear Matrix Inequality Constraints
• Primal-Dual Interior-Point Methods for Self-Scaled Cones
• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
• THE CENTRAL PATH IN SMOOTH CONVEX SEMIDEFINITE PROGRAMS
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization

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