Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone
From MaRDI portal
Publication:2405683
DOI10.1186/1029-242X-2014-308zbMath1372.90080WikidataQ59323302 ScholiaQ59323302MaRDI QIDQ2405683
Lin Wu, Guo-Qiang Wang, Yu-Jing Yue, Min-Min Li, Xin-Zhong Cai
Publication date: 26 September 2017
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Euclidean Jordan algebraskernel functioninterior-point methodspolynomial complexityconvex quadratic optimizationlarge- and small-update methods
Related Items
Primal-dual interior point QP-free algorithm for nonlinear constrained optimization ⋮ Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions ⋮ A primal-dual interior point algorithm for convex quadratic programming based on a new parametric kernel function
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones
- Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term
- A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- Handbook on semidefinite, conic and polynomial optimization
- A full-Newton step interior-point algorithm for symmetric cone convex quadratic optimization
- An interior-point algorithm for linear optimization based on a new barrier function
- Monotone functions on formally real Jordan algebras
- Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras
- A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization
- An inexact primal-dual path following algorithm for convex quadratic SDP
- An infeasible-interior-point predictor-corrector algorithm for the second-order cone program
- 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
- A new primal-dual path-following interior-point algorithm for semidefinite optimization
- Euclidean Jordan algebras and interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- A full Nesterov-Todd-step feasible primal-dual interior point algorithm for convex quadratic semi-definite optimization
- Self-regular functions and new search directions for linear and semidefinite optimization
- Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier
- A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
- Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function
- Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
- Function spaces and reproducing kernels on bounded symmetric domains
- Research Article: On Extending Primal-Dual Interior-Point Method for Linear Optimization to Convex Quadratic Symmetric Cone Optimization
- A new proximity function generating the best known iteration bounds for both large-update and small-update interior-point methods
- Generic Primal-dual Interior Point Methods Based on a New Kernel Function
- 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
- A Jordan-algebraic approach to potential-reduction algorithms