A generalized interior-point barrier function approach for smooth convex programming with linear constraints

DOI10.1080/02522667.1999.10699411zbMath0934.90057OpenAlexW2327964197MaRDI QIDQ4264497

No author found.

Publication date: 23 November 1999

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.1999.10699411

zbMATH Keywords

convex programminginterior point methodsbarrier functions

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items

Solving continuous min-max problems by an iterative entropic regularization method., An interior point parameterized central path following algorithm for linearly constrained convex programming

Cites Work

• A modification of Karmarkar's linear programming algorithm
• On some efficient interior point methods for nonlinear convex programming
• A polynomial method of approximate centers for linear programming
• Interior-point methods for convex programming
• An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence
• On the generalized path-following methods for linear programming
• Unnamed Item
• Unnamed Item