Kazan Federal University Digital Repository

# Browsing by Author "Zabotin I."

Sort by: Order: Results:

• (2014)
In this paper we propose a cutting method to solve a conditional minimization problem of a discrete maximum function. In the method some polyhedral set approximates the epigraph of the objective function, and to construct ...
• (2018)
© 2018, Pleiades Publishing, Ltd. We propose a method which belongs to a class of cutting methods for solving a convex programming problem. The developed method differs from traditional algorithms of the mentioned class ...
• (2015)
© 2015, Pleiades Publishing, Ltd. Propose a cutting-plane method with partially embedding of a feasible set for solving a conditional minimization problem. The proposed method is characterized by possibility of periodically ...
• (2016)
Copyright © by the paper's authors.An algorithm is suggested for solving a convex programming problem which belongs to a class of cutting methods. In the algorithm an epigraph of the objective function and a feasible ...
• (2016)
© Published under licence by IOP Publishing Ltd.We propose a conditional minimization method of the convex nonsmooth function which belongs to the class of cutting-plane methods. During constructing iteration points a ...
• (2016)
© 2016, Allerton Press, Inc.For a convex programming problem we propose a solution method which belongs to the class of cutting-plane methods. When constructing approximate solutions to the problem, this technique concurrently ...
• (2019)
© 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 ...
• (2015)
© 2015, Pleiades Publishing, Ltd. Propose a method for solving a mathematical programming problem from the class of cutting methods. In our method, on each step the epigraph of the objective function is embedded into a ...
• (2017)
© 2017 IEEE. We propose a method of conditional minimization of convex functions from the class of cutting methods. The method based on using of the exterior penalty functions. The iteration points are found by solving ...
• (1991)
It is shown that in optimization problems arising during electronic circuit design constraints often may be represented as a direct product of some sets from different spaces which in general may have different dimensions. ...
• (2013)
We propose a general cutting method for conditional minimization of continuous functions. We calculate iteration points by partially embeddimg the admissible set in approximating polyhedral sets. We describe the features ...
• (2016)
© 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 ...
• (2019)
© Published under licence by IOP Publishing Ltd. One of the convex programming methods that allows to reduce the solution of the original problem to the successive minimization of auxiliary functions on the whole space or ...
• (2019)
© 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. ...