A Polynomial Barrier Algorithm for Linearly Constrained Convex Programming Problems

DOI10.1287/MOOR.18.1.116MaRDI QIDQ4697086zbMATH OpenOpenAlexFDO

Authors

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\)-solutionlinearly constrained convex programlogarithmic barrier method

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2201985
• On controlling the parameter in the logarithmic barrier term for convex programming problems
• On the classical logarithmic barrier function method for a class of smooth convex programming problems
• A Logarithmic Barrier Function Algorithm for Quadratically Constrained Convex Quadratic Programming
• scientific article; zbMATH DE number 4193461

Cited in

(19)

• Long-step primal path-following algorithm for monotone variational inequality problems
• Investigation of path-following algorithms for signomial geometric programming problems
• On the classical logarithmic barrier function method for a class of smooth convex programming problems
• Controlled dual perturbations for central path trajectories in geometric programming
• A globally convergent primal-dual interior point algorithm for convex programming
• Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems
• Modified primal path-following scheme for the monotone variational inequality problem
• On controlling the parameter in the logarithmic barrier term for convex programming problems
• Linearly constrained convex programming as unconstrained differentiable concave programming
• Complexity analysis for certain convex programming problems
• An interior point parameterized central path following algorithm for linearly constrained convex programming
• Complexity of some inverse shortest path lengths problems
• scientific article; zbMATH DE number 7551027 (Why is no real title available?)
• A convex analysis view of the barrier problem
• scientific article; zbMATH DE number 2201985 (Why is no real title available?)
• A polynomial time infeasible interior-point arc-search algorithm for convex optimization
• Homogeneous second-order descent framework: a fast alternative to Newton-type methods
• A long-step barrier method for convex quadratic programming
• Theoretical efficiency of a shifted-barrier-function algorithm for linear programming

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4697086)