A large-update feasible interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function

DOI10.1007/s40305-013-0023-xzbMath1281.90033OpenAlexW2029162999MaRDI QIDQ384190

F. Hasani, Behrouz Kheirfam

Publication date: 27 November 2013

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-013-0023-x

zbMATH Keywords

kernel functionpolynomial complexityinterior-point algorithmlarge-update methods

Mathematics Subject Classification ID

Semidefinite programming (90C22) Convex programming (90C25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)

Related Items (1)

A method for weighted projections to the positive definite cone

Uses Software

• QSDP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Primal-dual interior-point algorithm for convex quadratic semi-definite optimization
• An inexact primal-dual path following algorithm for convex quadratic SDP
• A class of large-update and small-update primal-dual interior-point algorithms for linear optimization
• Self-regular functions and new search directions for linear and semidefinite optimization
• A large-update interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function
• A potential reduction algorithm for an extended SDP problem
• A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms
• A Polynomial-time Interior-point Algorithm for Convex Quadratic Semidefinite Optimization
• Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
• A new proximity function generating the best known iteration bounds for both large-update and small-update interior-point methods
• Kernel-function Based Algorithms for Semidefinite Optimization
• Self-Scaled Barriers and Interior-Point Methods for Convex Programming
• Primal-Dual Interior-Point Methods for Self-Scaled Cones
• A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
• A polynomial-time algorithm for linear optimization based on a new simple kernel function
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• Handbook of semidefinite programming. Theory, algorithms, and applications
• A predictor--corrector algorithm for QSDP combining Dikin-type and Newton centering steps

This page was built for publication: A large-update feasible interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function