An infeasible interior point method for the monotone SDLCP based on a transformation of the central path
type: Item
instance of: scholarly article
title: An infeasible interior point method for the monotone SDLCP based on a transformation of the central path
zbMATH Open document ID: 1392.90125
published in: Journal of Applied Mathematics and Computing
publication date: 2018-07-19T00:00:00Z
Mathematics Subject Classification ID: 90C51
Mathematics Subject Classification ID: 90C22
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 6908571
zbMATH Keywords: semidefinite linear complementarity problem
zbMATH Keywords: infeasible interior-point method
zbMATH Keywords: Nesterov-Todd scaling scheme
zbMATH Keywords: polynomial complexity
author: Behrouz Kheirfam
MaRDI profile type: Publication
full work available at URL: s12190-017-1128-x
OpenAlex ID: W2750367319
cites work: A new primal-dual path-following method for convex quadratic programming
cites work: Complexity analysis of primaldual algorithms for the semidefinite linear complementarity problem
cites work: A full-Newton step infeasible interior-point algorithm based on darvay directions for linear optimization
cites work: A Full-Newton step infeasible-interior-point algorithm for P*(k)-horizontal linear complementarity problems
cites work: Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
cites work: Q3415802
cites work: Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
cites work: A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
cites work: Aspects of semidefinite programming. Interior point algorithms and selected applications
cites work: On semidefinite linear complementarity problems
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: An improved full-Newton step \(O(n)\) infeasible interior-point method for horizontal linear complementarity problem
cites work: A full step infeasible interior-point method for Cartesian \(P_{*}(\kappa)\)-SCLCP
cites work: New complexity analysis of a full Nesterov–Todd step interior-point method for semidefinite optimization
cites work: An infeasible interior-point algorithm based on modified Nesterov and Todd directions for symmetric linear complementarity problem
cites work: A primal-dual infeasible-interior-point algorithm for linear programming
cites work: Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
cites work: Feasibility issues in a primal-dual interior-point method for linear programming
cites work: A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
cites work: Self-Scaled Barriers and Interior-Point Methods for Convex Programming
cites work: Primal-Dual Interior-Point Methods for Self-Scaled Cones
cites work: New complexity analysis of the primal-dual method for semidefinite optimization based on the Nesterov-Todd direction
cites work: An exact duality theory for semidefinite programming and its complexity implications
cites work: An Improved and Simplified Full-Newton Step $O(n)$ Infeasible Interior-Point Method for Linear Optimization
cites work: Merit functions for semi-definite complementarity problems
cites work: A new primal-dual path-following interior-point algorithm for semidefinite optimization
cites work: Handbook of semidefinite programming. Theory, algorithms, and applications
cites work: A full-Newton step infeasible interior-point algorithm for monotone LCP based on a locally-kernel function
DOI: 10.1007/S12190-017-1128-X
description: scientific article; zbMATH DE number 6908571