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.078MaRDI QIDQ425872zbMATH OpenOpenAlexFDO

Authors Bo Kyung Choi, Gue Myung Lee

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 functioncomplexity analysisproximity functionworst-case iteration bounddual interior-point methodsprimalsemidefinite optimization problem

Mathematics Subject Classification ID

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

Recommendations

• A primal‐dual interior-point method for linear optimization based on a new proximity function
• AN INTERIOR POINT APPROACH FOR SEMIDEFINITE OPTIMIZATION USING NEW PROXIMITY FUNCTIONS
• scientific article; zbMATH DE number 741122
• Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function
• A new primal-dual interior-point algorithm for semidefinite optimization
• A new primal-dual interior-point algorithm for solving semidefinite optimization
• Some new search directions for primal-dual interior point methods in semidefinite programming
• Complexity analysis of interior-point algorithm based on a new kernel function for semidefinite optimization
• Analysis of complexity of primal-dual interior-point algorithms based on a new kernel function for linear optimization
• New complexity analysis for primal-dual interior-point methods for self-scaled optimization problems

Cites work

• scientific article; zbMATH DE number 194139 (Why is no real title available?)
• scientific article; zbMATH DE number 729680 (Why is no real title available?)
• scientific article; zbMATH DE number 1047679 (Why is no real title available?)
• scientific article; zbMATH DE number 1489798 (Why is no real title available?)
• scientific article; zbMATH DE number 1534295 (Why is no real title available?)
• scientific article; zbMATH DE number 1862745 (Why is no real title available?)
• scientific article; zbMATH DE number 781861 (Why is no real title available?)
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• A mathematical view of interior-point methods in convex optimization
• A new and efficient large-update interior-point method for linear optimization
• A new large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems
• A new large-update interior point algorithm for \(P_{*}(\kappa)\) LCPs based on kernel functions
• A study of search directions in primal-dual interior-point methods for semidefinite programming
• Aspects of semidefinite programming. Interior point algorithms and selected applications
• Complexity of large-update interior point algorithm for \(P_{*}(\kappa )\) linear complementarity problems
• Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
• On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
• On the Nesterov--Todd Direction in Semidefinite Programming
• Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities
• Self-Scaled Barriers and Interior-Point Methods for Convex Programming
• Self-regular functions and new search directions for linear and semidefinite optimization
• Symmetric primal-dual path-following algorithms for semidefinite programming

Cited in

(12)

• 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
• A polynomial interior-point algorithm with improved iteration bounds for linear optimization
• A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function
• An efficient parameterized logarithmic kernel function for semidefinite optimization
• 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 analysis of an interior point algorithm for the semidefinite optimization based on a kernel function with a double barrier term
• A large-update interior-point method for Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones
• An efficient hyperbolic kernel function yielding the best known iteration bounds for linear programming
• Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions
• On complexity analysis of the primal-dual interior-point method for second-order cone optimization problem

This page was built for publication: On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q425872)