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

DOI10.1007/S10114-012-0194-0zbMath1254.90158OpenAlexW2115035264MaRDI QIDQ1928163

Ming Wang Zhang

Publication date: 2 January 2013

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-012-0194-0

zbMATH Keywords

complexitykernel functioninterior-point algorithmlarge-update methodconvex quadratic semi-definite optimization

Mathematics Subject Classification ID

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

Related Items (8)

A large-update feasible interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function ⋮ Unnamed Item ⋮ A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions ⋮ An efficient parameterized logarithmic kernel function for semidefinite optimization ⋮ An efficient primal-dual interior point algorithm for convex quadratic semidefinite optimization ⋮ A large-update primal-dual interior-point algorithm for convex quadratic optimization based on a new bi-parameterized bi-hyperbolic Kernel function ⋮ 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

Cites Work

• Unnamed Item
• A new polynomial-time algorithm for linear programming
• Primal-dual interior-point algorithm for convex quadratic semi-definite optimization
• An inexact primal-dual path following algorithm for convex quadratic SDP
• Solving Euclidean distance matrix completion problems via semidefinite progrmming
• Search directions in the SDP and the monotone SDLCP: Generalization and inexact computation
• Self-regular functions and new search directions for linear and semidefinite optimization
• A potential reduction algorithm for an extended SDP problem
• Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
• A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
• 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 Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• New complexity analysis of the primal-dual Newton method for linear optimization
• A predictor--corrector algorithm for QSDP combining Dikin-type and Newton centering steps

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