The method of quasi-solutions based on barrier functions in the analysis of improper convex programs

DOI10.1134/S0081543822060219OpenAlexW4321128370MaRDI QIDQ2692754

V. D. Skarin

Publication date: 23 March 2023

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

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

zbMATH Keywords

convex programmingoptimal correctionimproper problembarrier function methodsmethod of quasi-solutions

Mathematics Subject Classification ID

Numerical analysis (65-XX) Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Barrier function method and correction algorithms for improper convex programming problems
• Minimum-Euclidean-norm matrix correction for a pair of dual linear programming problems
• Determination of consistency and inconsistency radii for systems of linear equations and inequalities using the matrix \(l_1\) norm
• On some universal methods of correction of the improper convex programming problems
• Use of barrier functions for optimal correction of improper problems of linear programming of the 1st kind
• Lexicographic regularization and duality for improper linear programming problems
• Extragradient method for correction of inconsistent linear programming problems
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• Efficient Algorithms for Solution of Regularized Total Least Squares
• Tikhonov Regularization and Total Least Squares

This page was built for publication: The method of quasi-solutions based on barrier functions in the analysis of improper convex programs