Barrier function method and correction algorithms for improper convex programming problems

DOI10.1134/S0081543808060126zbMath1182.90068OpenAlexW2066234634MaRDI QIDQ735654

V. D. Skarin

Publication date: 23 October 2009

Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0081543808060126

zbMATH Keywords

convergence estimatesinverse barrier function

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (4)

On the construction of regularizing algorithms for the correction of improper convex programming problems ⋮ The method of quasi-solutions based on barrier functions in the analysis of improper convex programs ⋮ Interior penalty functions and duality in linear programming ⋮ On the choice of parameters in the residual method for the optimal correction of improper problems of convex optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• Modified barrier functions (theory and methods)
• Computational methods in optimization. A unified approach.
• A stable interior penalty method for convex extremal problems
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• Convex Analysis

This page was built for publication: Barrier function method and correction algorithms for improper convex programming problems