Kernel function based interior-point algorithms for semidefinite optimization

DOI10.7153/MIA-16-98zbMATH Open1292.90319OpenAlexW2322896755MaRDI QIDQ5406166FDOQ5406166

Author name not available (Why is that?)

Publication date: 1 April 2014

Published in: Mathematical Inequalities & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7153/mia-16-98

zbMATH Keywords

polynomial complexitysemidefinite optimizationprimal-dual methodinterior-point methodsmalland large-update method

Mathematics Subject Classification ID

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

Cited In (8)

• A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function
• Complexity analysis of interior-point algorithm based on a new kernel function for semidefinite optimization
• An Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function
• A path following interior-point algorithm for semidefinite optimization problem based on new kernel function
• Title not available (Why is that?)
• Interior-Point Algorithms for Semidefinite Programming Problems Derived from the KYP Lemma
• Complexity analysis of primal-dual interior-point methods for convex quadratic programming based on a new twice parameterized kernel function
• Semidefinite optimization providing guaranteed bounds on linear functionals of solutions of linear integral equations with smooth kernels

This page was built for publication: Kernel function based interior-point algorithms for semidefinite optimization

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