An infeasible full-NT step interior point algorithm for CQSCO
type: Item
instance of: scholarly article
title: An infeasible full-NT step interior point algorithm for CQSCO
zbMATH Open document ID: 1360.90290
author: Behrouz Kheirfam
published in: Numerical Algorithms
publication date: 2017-01-12T00:00:00Z
review text: This article studies the convex quadratic symmetric cone optimization problem based on Euclidean Jordan algebras. The article begins with an introduction to Euclidean Jordan algebra and its properties and a short overview of the literature. The author then presents an infeasible interior-point algorithm for solving this optimization problem, followed by an analysis of the properties of the algorithm. The article concludes with a section on numerical results performed using matlab.
reviewed by: Efstratios Rappos
Mathematics Subject Classification ID: 90C51
zbMATH DE Number: 6674012
zbMATH Keywords: convex quadratic symmetric cone optimization
zbMATH Keywords: interior-point method
zbMATH Keywords: infeasible method
zbMATH Keywords: Euclidean Jordan algebra
zbMATH Keywords: polynomial complexity
describes a project that uses: NETLIB LP Test Set
describes a project that uses: Matlab
MaRDI profile type: Publication
full work available at URL: s11075-016-0140-9
OpenAlex ID: W2407544881
cites work: A full-Newton step interior-point algorithm for symmetric cone convex quadratic optimization
cites work: Q4321748
cites work: A Jordan-algebraic approach to potential-reduction algorithms
cites work: Linear systems in Jordan algebras and primal-dual interior-point algorithms
cites work: A full Nesterov-Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem
cites work: A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems
cites work: A new infeasible interior-point method based on Darvay's technique for symmetric optimization
cites work: A full Nesterov-Todd step infeasible interior-point algorithm for symmetric optimization based on a specific kernel function
cites work: A full step infeasible interior-point method for Cartesian \(P_{*}(\kappa)\)-SCLCP
cites work: An improved full-Newton step \(O(n)\) infeasible interior-point method for horizontal linear complementarity problem
cites work: A corrector-predictor path-following method for convex quadratic symmetric cone optimization
cites work: A primal-dual infeasible-interior-point algorithm for linear programming
cites work: Q3067612
cites work: Feasibility issues in a primal-dual interior-point method for linear programming
cites work: Self-Scaled Barriers and Interior-Point Methods for Convex Programming
cites work: Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
cites work: A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
cites work: An Improved and Simplified Full-Newton Step $O(n)$ Infeasible Interior-Point Method for Linear Optimization
cites work: Q4339096
cites work: Extension of primal-dual interior point algorithms to symmetric cones
cites work: Similarity and other spectral relations for symmetric cones
cites work: Research Article: On Extending Primal-Dual Interior-Point Method for Linear Optimization to Convex Quadratic Symmetric Cone Optimization
cites work: A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization
DOI: 10.1007/S11075-016-0140-9
description: scientific article; zbMATH DE number 6674012