On controlling the parameter in the logarithmic barrier term for convex programming problems

DOI10.1007/BF02191739zbMath0827.90113OpenAlexW1978012011MaRDI QIDQ1893461

Yanyan Li

Publication date: 4 July 1995

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02191739

zbMATH Keywords

interior-point methodslinearly constrained convex differentiable programminglog-barrier based algorithm

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30)

Related Items

Controlled dual perturbations for central path trajectories in geometric programming, An infeasible interior-point algorithm for solving primal and dual geometric programs, An interior point parameterized central path following algorithm for linearly constrained convex programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A long-step barrier method for convex quadratic programming
• On some efficient interior point methods for nonlinear convex programming
• On the primal and dual constraint sets in geometric programming
• An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence
• A path following algorithm for a class of convex programming problems
• Path-Following Methods for Linear Programming
• On a classification scheme for geometric programming and complementarity theorems†^†
• A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier
• A Polynomial Barrier Algorithm for Linearly Constrained Convex Programming Problems
• Convex Analysis
• Solution Sets of Convex Programs Related to Chemical Equilibrium Problems