Barrier function method and correction algorithms for improper convex programming problems

DOI10.1134/S0081543808060126MaRDI QIDQ735654zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Regularized Lagrange function and correction methods for improper convex programming problems
• On some universal methods of correction of the improper convex programming problems
• scientific article; zbMATH DE number 3956824
• Publication:3035145
• On the construction of regularizing algorithms for the correction of improper convex programming problems

Cites work

• scientific article; zbMATH DE number 3828663 (Why is no real title available?)
• scientific article; zbMATH DE number 3910129 (Why is no real title available?)
• scientific article; zbMATH DE number 3972626 (Why is no real title available?)
• scientific article; zbMATH DE number 3793774 (Why is no real title available?)
• scientific article; zbMATH DE number 3307153 (Why is no real title available?)
• A new polynomial-time algorithm for linear programming
• A stable interior penalty method for convex extremal problems
• Computational methods in optimization. A unified approach.
• Convex Analysis
• Modified barrier functions (theory and methods)
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method

Cited in

(7)

• On the choice of parameters in the residual method for the optimal correction of improper problems of convex optimization
• On the construction of regularizing algorithms for the correction of improper convex programming problems
• Search of generalized solutions to improper linear and convex programming problems using barrier functions
• Two properties of condition numbers for convex programs via implicitly defined barrier functions
• Interior penalty functions and duality in linear programming
• Schemes of involving dual variables in inverse barrier functions for problems of linear and convex programming
• The method of quasi-solutions based on barrier functions in the analysis of improper convex programs

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

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