Schemes of involving dual variables in inverse barrier functions for problems of linear and convex programming

DOI10.1134/S0081543809060169zbMATH Open1271.90060MaRDI QIDQ643743FDOQ643743

Authors: Leonid Denisovich Popov 

Publication date: 2 November 2011

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

Recommendations

• One modification of the logarithmic barrier function method in linear and convex programming
• Barrier function method and correction algorithms for improper convex programming problems
• scientific article; zbMATH DE number 1070399
• Search of generalized solutions to improper linear and convex programming problems using barrier functions
• Dual barrier functions with superfast rates of convergence for the linear programming problem

zbMATH Keywords

mathematical programmingLagrange multipliersnumerical methodsinterior penalty methodsbarrier functions

Mathematics Subject Classification ID

Convex programming (90C25) Linear programming (90C05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (4)

• Inverse barrier methods for linear programming
• One modification of the logarithmic barrier function method in linear and convex programming
• Interior penalty functions and duality in linear programming
• Using feedback functions in linear programming problems

This page was built for publication: Schemes of involving dual variables in inverse barrier functions for problems of linear and convex programming

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