On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function

DOI10.1016/j.na.2009.05.078zbMath1239.90105OpenAlexW1999253911MaRDI QIDQ425872

Gue Myung Lee, Bo Kyung Choi

Publication date: 9 June 2012

Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.na.2009.05.078

zbMATH Keywords

kernel functionprimalcomplexity analysisproximity functionworst-case iteration bounddual interior-point methodssemidefinite optimization problem

Mathematics Subject Classification ID

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

Related Items

Primal-dual interior point methods for Semidefinite programming based on a new type of kernel functions ⋮ New complexity analysis for primal-dual interior-point methods for self-scaled optimization problems ⋮ Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions ⋮ A large-update interior-point method for Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones ⋮ A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function ⋮ Complexity analysis of an interior point algorithm for the semidefinite optimization based on a kernel function with a double barrier term ⋮ An efficient parameterized logarithmic kernel function for semidefinite optimization ⋮ Complexity analysis of primal-dual interior-point methods for semidefinite optimization based on a parametric kernel function with a trigonometric barrier term ⋮ Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new large-update interior point algorithm for \(P_{*}(\kappa)\) LCPs based on kernel functions
• Symmetric primal-dual path-following algorithms for semidefinite programming
• Aspects of semidefinite programming. Interior point algorithms and selected applications
• Self-regular functions and new search directions for linear and semidefinite optimization
• Complexity of large-update interior point algorithm for \(P_{*}(\kappa )\) linear complementarity problems
• A new large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems
• A Mathematical View of Interior-Point Methods in Convex Optimization
• Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
• On the Nesterov--Todd Direction in Semidefinite Programming
• Self-Scaled Barriers and Interior-Point Methods for Convex Programming
• On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
• A study of search directions in primal-dual interior-point methods for semidefinite programming
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities