A Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization
type: Item
instance of: scholarly article
title: A Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization
zbMATH Open document ID: 1311.65075
author: Ximei Yang
author: Hongwei Liu
author: Changhe Liu
published in: Journal of Computational and Applied Mathematics
publication date: 2015-03-24T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C51
zbMATH DE Number: 6419096
zbMATH Keywords: symmetric cones
zbMATH Keywords: Euclidean Jordan algebra
zbMATH Keywords: one-norm
zbMATH Keywords: infeasible-interior-point method
zbMATH Keywords: complexity bound
zbMATH Keywords: predictor-corrector method
zbMATH Keywords: symmetric optimization
zbMATH Keywords: algorithm
zbMATH Keywords: convergence
zbMATH Keywords: Nesterov-Todd search direction
MaRDI profile type: Publication
full work available at URL: j.cam.2015.01.027
OpenAlex ID: W1976425051
cites work: Primal-Dual Interior-Point Methods for Self-Scaled Cones
cites work: Barrier Functions in Interior Point Methods
cites work: Linear systems in Jordan algebras and primal-dual interior-point algorithms
cites work: Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
cites work: Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
cites work: Extension of primal-dual interior point algorithms to symmetric cones
cites work: On a commutative class of search directions for linear programming over symmetric cones
cites work: Associative and Jordan algebras, and polynomial time interior-point algorithms for symmetric cones.
cites work: A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
cites work: A primal-dual infeasible-interior-point algorithm for linear programming
cites work: On the Implementation of a Primal-Dual Interior Point Method
cites work: On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
cites work: Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming
cites work: Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones
cites work: Function spaces and reproducing kernels on bounded symmetric domains
cites work: Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones
cites work: Some P-properties for linear transformations on Euclidean Jordan algebras
cites work: Q4040931
cites work: Q3998992
cites work: A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with $O(\sqrt{n}\log\frac{\mathrm{Tr}(X^0S^0)}{\epsilon})$ Iteration Complexity
cites work: An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
cites work: On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
DOI: 10.1016/J.CAM.2015.01.027
description: scientific article; zbMATH DE number 6419096