Complexity analysis of interior-point algorithm based on a new kernel function for semidefinite optimization

DOI10.1007/S11741-008-0503-2zbMATH Open1174.90737OpenAlexW1505061005MaRDI QIDQ5320239FDOQ5320239

Authors: Zhonggen Qian, Yanqin Bai, Guoqiang Wang 

Publication date: 22 July 2009

Published in: Journal of Shanghai University (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11741-008-0503-2

Recommendations

• Complexity analysis of an interior point algorithm for the semidefinite optimization based on a kernel function with a double barrier term
• Complexity analysis of interior-point methods for linear optimization based on some conditions on kernel function
• Analysis of complexity of primal-dual interior-point algorithms based on a new kernel function for linear optimization
• Complexity analysis of interior point methods for linear programming based on a parameterized kernel function
• Complexity analysis of infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel function
• Kernel function based interior-point algorithms for semidefinite optimization
• A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions
• Complexity analysis of an interior-point algorithm for linear optimization based on a new parametric kernel function with a double barrier term
• An Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function
• Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function

zbMATH Keywords

polynomial complexitysemidefinite optimizationprimal-dual methodinterior-point algorithm

Mathematics Subject Classification ID

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

Cites Work

• Self-regular functions and new search directions for linear and semidefinite optimization
• Title not available (Why is that?)
• A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• Title not available (Why is that?)
• Handbook of semidefinite programming. Theory, algorithms, and applications
• On the Nesterov--Todd Direction in Semidefinite Programming
• Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
• A primal‐dual interior-point method for linear optimization based on a new proximity function

Cited In (16)

• Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term
• A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions
• Interior-point algorithms for LO and SDO based on a new class of kernel functions
• Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems
• 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
• Interior-point algorithm for SDO based on new classes of kernel functions
• Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
• A Complexity Analysis for Interior-Point Algorithms Based on Karmarkar’s Potential Function
• A path following interior-point algorithm for semidefinite optimization problem based on new kernel function
• Title not available (Why is that?)
• A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions
• Interior-point algorithm for linear optimization based on a new trigonometric kernel function
• 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
• On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function

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

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