A full-Newton step interior-point algorithm for symmetric cone convex quadratic optimization

DOI10.3934/jimo.2011.7.891zbMath1263.90125OpenAlexW2321765371MaRDI QIDQ656447

Lipu Zhang, Yan-Qin Bai

Publication date: 18 January 2012

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2011.7.891

zbMATH Keywords

Euclidean Jordan algebrascomplexity analysissymmetric conefull-Newton stepNT-search direction

Mathematics Subject Classification ID

Convex programming (90C25) Interior-point methods (90C51) Jordan algebras (algebras, triples and pairs) (17C99)

Related Items (9)

Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone ⋮ Corrector-predictor interior-point method with new search direction for semidefinite optimization ⋮ A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization ⋮ An infeasible full-NT step interior point algorithm for CQSCO ⋮ A corrector-predictor path-following method for convex quadratic symmetric cone optimization ⋮ An inexact modified Newton method for VISCC and application in grasping force ⋮ Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming ⋮ A primal-dual interior-point algorithm for symmetric cone convex quadratic programming based on the commutative class directions ⋮ Research Article: On Extending Primal-Dual Interior-Point Method for Linear Optimization to Convex Quadratic Symmetric Cone Optimization

This page was built for publication: A full-Newton step interior-point algorithm for symmetric cone convex quadratic optimization