Abstract
The possibilities of using augmented penalty functions for the regularization and optimal correction of convex programming problems are investigated. Convergence conditions are formulated for the corresponding methods and an iteration algorithm for a linear optimization problem is proposed.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Proceedings of the Steklov Institute of Mathematics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
