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-3zbMATH Open1223.65046OpenAlexW2063153802MaRDI QIDQ634734FDOQ634734
Authors: Guoqiang Wang, Detong Zhu 
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
Recommendations
- scientific article; zbMATH DE number 6515403
- Kernel function based interior-point algorithms for semidefinite optimization
- Primal-dual interior-point algorithm for convex quadratic semi-definite optimization
- Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone
- Primal-dual interior point algorithms for semidefinite optimization based on a kernel function with quadratic growth rate
kernel functionprimal-dual interior-point algorithmsiteration boundlarge and small update methodsconvex quadratic semidefinite optimization
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Convex programming (90C25) Interior-point methods (90C51) Semidefinite programming (90C22)
Cites Work
- Title not available (Why is that?)
- A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
- Self-regular functions and new search directions for linear and semidefinite optimization
- An infeasible interior-point algorithm with full-Newton step for linear optimization
- A new proximity function generating the best known iteration bounds for both large-update and small-update interior-point methods
- Title not available (Why is that?)
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Handbook of semidefinite programming. Theory, algorithms, and applications
- An inexact primal-dual path following algorithm for convex quadratic SDP
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Title not available (Why is that?)
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- 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 class of large-update and small-update primal-dual interior-point algorithms for linear optimization
- A polynomial-time algorithm for linear optimization based on a new simple kernel function
- Solving Euclidean distance matrix completion problems via semidefinite progrmming
- Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions
- Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
- Kernel-function Based Algorithms for Semidefinite Optimization
- A predictor--corrector algorithm for QSDP combining Dikin-type and Newton centering steps
- Primal-dual interior-point algorithm for convex quadratic semi-definite optimization
- New complexity analysis of the primal-dual Newton method for linear optimization
- A primal‐dual interior-point method for linear optimization based on a new proximity function
Cited In (17)
- Complexity analysis of infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel function
- Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems
- 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
- A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints
- An Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function
- Primal-dual interior-point algorithms for convex quadratic circular cone optimization
- A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions
- A primal-dual interior point algorithm for convex quadratic programming based on a new parametric kernel function
- Solving a class of inverse semidefinite quadratic programming problem
- Title not available (Why is that?)
- 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
- Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions
- A large-update feasible interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function
- A primal-dual interior-point algorithm for symmetric cone convex quadratic programming based on the commutative class directions
Uses Software
This page was built for publication: A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q634734)
