A large-update interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function
From MaRDI portal
Publication:1928163
DOI10.1007/s10114-012-0194-0zbMath1254.90158MaRDI QIDQ1928163
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
complexity; kernel function; interior-point algorithm; large-update method; convex quadratic semi-definite optimization
90C22: Semidefinite programming
90C25: Convex programming
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
Related Items
A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions, A large-update feasible interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function, An efficient parameterized logarithmic kernel function for semidefinite optimization, Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems, Complexity analysis of primal-dual interior-point methods for semidefinite optimization based on a parametric kernel function with a trigonometric barrier term
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
