© 2019, Kazan Federal University. All rights reserved. A method for solving the convex programming problem, which is ideologically close to the known methods of external penalties, was proposed. The method uses auxiliary ...

© Published under licence by IOP Publishing Ltd.We propose an algorithm for solving a convex programming problem from the class of cutting methods. The algorithm is characterized by the construction of approximations using ...

© Published under licence by IOP Publishing Ltd. In order to improve the practical implementation of the previously proposed cutting plane method, we have developed a procedure for updating immersive polyhedral sets in it. ...