New method for determining search directions for interior-point algorithms in linear optimization
type: Item
instance of: scholarly article
title: New method for determining search directions for interior-point algorithms in linear optimization
zbMATH Open document ID: 1421.90080
author: Zsolt Darvay
author: Petra-Renáta Takács
published in: Optimization Letters
publication date: 2018-07-31T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C51
zbMATH DE Number: 6911941
zbMATH Keywords: interior-point algorithm
zbMATH Keywords: linear optimization
zbMATH Keywords: algebraic equivalent transformation
zbMATH Keywords: search direction
zbMATH Keywords: Newton's method
zbMATH Keywords: polynomial complexity
MaRDI profile type: Publication
full work available at URL: s11590-017-1171-4
OpenAlex ID: W2736530414
cites work: A new primal-dual path-following method for convex quadratic programming
cites work: Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems
cites work: An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
cites work: Q4347846
cites work: Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
cites work: A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
cites work: A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
cites work: Q3844775
cites work: Q5309527
cites work: Q3415802
cites work: Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
cites work: Pivot versus interior point methods: Pros and cons
cites work: EP theorem for dual linear complementarity problems
cites work: Polynomial interior point algorithms for general linear complementarity problems
cites work: A polynomial path-following interior point algorithm for general linear complementarity problems
cites work: The theory of linear programming:skew symmetric self-dual problems and the central path*
cites work: A new polynomial-time algorithm for linear programming
cites work: A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem
cites work: Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids
cites work: A unified approach to interior point algorithms for linear complementarity problems: A summary
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: A polynomial interior-point algorithm for monotone linear complementarity problems
cites work: On the Implementation of a Primal-Dual Interior Point Method
cites work: Q4324980
cites work: Q4791754
cites work: Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function
cites work: A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with \(O(\sqrt nL)\)-iteration complexity
cites work: Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
cites work: A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP
cites work: Q4339096
cites work: Q3738934
cites work: A convergent criss-cross method
cites work: An easy way to teach interior-point methods.
cites work: A new polynomial interior-point algorithm for the monotone linear complementarity problem over symmetric cones with full NT-steps
cites work: A new primal-dual path-following interior-point algorithm for semidefinite optimization
cites work: A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
cites work: A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
cites work: Q5691079
cites work: Q4382667
cites work: An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
cites work: A full-Newton step interior-point algorithm based on modified Newton direction
cites work: A new primal-dual path-following interior-point algorithm for linearly constrained convex optimization
DOI: 10.1007/S11590-017-1171-4
description: scientific article; zbMATH DE number 6911941