A Polynomial Barrier Algorithm for Linearly Constrained Convex Programming Problems

DOI10.1287/moor.18.1.116zbMath0783.90099OpenAlexW2053752806MaRDI QIDQ4697086

No author found.

Publication date: 29 June 1993

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.18.1.116

zbMATH Keywords

\(\varepsilon\)-solutionlogarithmic barrier methodlinearly constrained convex program

Mathematics Subject Classification ID

Convex programming (90C25) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (10)

Controlled dual perturbations for central path trajectories in geometric programming ⋮ A globally convergent primal-dual interior point algorithm for convex programming ⋮ On controlling the parameter in the logarithmic barrier term for convex programming problems ⋮ Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems ⋮ Modified primal path-following scheme for the monotone variational inequality problem ⋮ A polynomial time infeasible interior-point arc-search algorithm for convex optimization ⋮ Complexity of some inverse shortest path lengths problems ⋮ Long-step primal path-following algorithm for monotone variational inequality problems ⋮ Investigation of path-following algorithms for signomial geometric programming problems ⋮ An interior point parameterized central path following algorithm for linearly constrained convex programming

This page was built for publication: A Polynomial Barrier Algorithm for Linearly Constrained Convex Programming Problems