Penalty Function Method and Regularization in the Analysis of Improper Convex Programs-Reference-Cited by-同舟云学术

Penalty Function Method and Regularization in the Analysis of Improper Convex Programs

Published:2019-07 Issue:S1 Volume:305 Page:S166-S177
ISSN:0081-5438
Container-title:Proceedings of the Steklov Institute of Mathematics
language:en
Short-container-title:Proc. Steklov Inst. Math.

Author:

Skarin V. D.

Publisher

Pleiades Publishing Ltd

Subject

Mathematics (miscellaneous)

Link

http://link.springer.com/content/pdf/10.1134/S0081543819040175.pdf

Reference15 articles.

1. I. I. Eremin, Vl. D. Mazurov, and N. N. Astaf’ev, Improper Problems of Linear and Convex Programming (Nauka, Moscow, 1983) [in Russian].

2. Vl. D. Mazurov, Committee Method in Problems of Optimization and Classification (Nauka, Moscow, 1990) [in Russian].

3. M. Yu. Khachay, “On approximate algorithm of a minimal committee of a linear inequalities system,” Pattern Recogn. Image Anal. 13(3), 459–464 (2003).

4. L. D. Popov, “Use of barrier functions for optimal correction of improper problems of linear programming of the 1st kind,” Autom. Remote Control 73(3), 417–424 (2012).

5. V. I. Erokhin, A. S. Krasnikov, and M. N. Khvostov, “Matrix corrections minimal with respect to the Euclidean norm for linear programming problems,” Autom. Remote Control 73(2), 219–231 (2012).

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Trajectory optimization for manipulators based on external archives self-searching multi-objective particle swarm optimization;Proceedings of the Institution of Mechanical Engineers, Part C: Journal of Mechanical Engineering Science;2021-06-03