Complexity analysis of infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel function

DOI10.1007/s11590-018-1257-7zbMath1417.90113OpenAlexW2795578936MaRDI QIDQ1733331

Morteza Moslemi, Behrouz Kheirfam

Publication date: 21 March 2019

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-018-1257-7

zbMATH Keywords

semidefinite optimizationpolynomial complexityinfeasible interior-point methodfull Nesterov-Todd steptrigonometric kernel function

Mathematics Subject Classification ID

Semidefinite programming (90C22) Interior-point methods (90C51)

Related Items (1)

A full-Newton step infeasible interior-point algorithm based on a kernel function with a new barrier term

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A full Nesterov-Todd step infeasible interior-point algorithm for symmetric optimization based on a specific kernel function
• A full Nesterov-Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem
• A generic interior-point algorithm for monotone symmetric cone linear complementarity problems based on a new kernel function
• A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO
• Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term
• A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization
• A full-Newton step infeasible interior-point algorithm for linear programming based on a kernel function
• A new primal-dual path-following interior-point algorithm for semidefinite optimization
• Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
• Aspects of semidefinite programming. Interior point algorithms and selected applications
• Self-regular functions and new search directions for linear and semidefinite optimization
• A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
• A full-Newton step infeasible interior-point method for linear optimization based on a trigonometric kernel function
• A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm 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
• On homogeneous interrior-point algorithms for semidefinite programming
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• A polynomial-time algorithm for linear optimization based on a new kernel function with trigonometric barrier term
• SimplifiedO(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps
• A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
• Handbook of semidefinite programming. Theory, algorithms, and applications
• New complexity analysis of the primal-dual method for semidefinite optimization based on the Nesterov-Todd direction

This page was built for publication: Complexity analysis of infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel function