A minimization method with approximation of feasible set and epigraph of objective function belongs to the class of
cutting-plane methods. When constructing approximate solutions to the problem
Cutting-plane method based on epigraph approximation with discarding the cutting planes from the class of
cutting methods. In our
method, on each step the epigraph of the objective function
A Cutting method for finding discrete minimax with dropping of cutting planesIn this paper we propose a
cutting method to solve a conditional minimization problem of a discrete
One approach to constructing cutting algorithms with dropping of cutting planesWe propose a general
cutting method for conditional minimization of continuous functions. We
A cutting-plane method without inclusions of approximating sets for conditional minimization© 2015, Pleiades Publishing, Ltd. Propose a
cutting-plane method with partially embedding of a
A minimization method with approximation of feasible set and epigraph of objective function belongs to the class of
cutting-plane methods. When constructing approximate solutions to the problem
A Cutting method for finding discrete minimax with dropping of cutting planesIn this paper we propose a
cutting method to solve a conditional minimization problem of a discrete
One approach to constructing cutting algorithms with dropping of cutting planesWe propose a general
cutting method for conditional minimization of continuous functions. We
A cutting-plane method without inclusions of approximating sets for conditional minimization© 2015, Pleiades Publishing, Ltd. Propose a
cutting-plane method with partially embedding of a
Constructing Mixed Algorithms on the Basis of Some Bundle Method method during discarding the
cutting planes the main iteration points are fixed with the relaxation