A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO
From MaRDI portal
Publication:634734
DOI10.1007/s11075-010-9444-3zbMath1223.65046MaRDI QIDQ634734
Publication date: 16 August 2011
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-010-9444-3
kernel function; iteration bound; primal-dual interior-point algorithms; large and small update methods; convex quadratic semidefinite optimization
65K05: Numerical mathematical programming methods
90C22: Semidefinite programming
90C25: Convex programming
90C20: Quadratic programming
90C51: Interior-point methods
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, Complexity analysis of infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel function, Complexity analysis of primal-dual interior-point methods for semidefinite optimization based on a parametric kernel function with a trigonometric barrier term, Primal-dual interior-point algorithms for convex quadratic circular cone optimization, Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone, Complexity analysis and numerical implementation of large-update interior-point methods for SDLCP based on a new parametric barrier kernel function
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Primal-dual interior-point algorithm for convex quadratic semi-definite optimization
- An inexact primal-dual path following algorithm for convex quadratic SDP
- Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions
- A class of large-update and small-update primal-dual interior-point algorithms for linear optimization
- Solving Euclidean distance matrix completion problems via semidefinite progrmming
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Self-regular functions and new search directions for linear and semidefinite optimization
- 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
- An infeasible interior-point algorithm with full-Newton step for linear optimization
- Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
- 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 primal‐dual interior-point method for linear optimization based on a new proximity function
- 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
- 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
