По вашему запросу найдено документов: 323548
Страница 1 из 32355
Application of the penalty method to nonstationary approximation of an optimization problemWe solve a general optimization problem, where only approximation sequences are known instead
Real number approximation by a rational number in the approximating k-ary algorithm algorithm for computing the greatest common divisor. The approximation based on Farey sequences
A Cutting Method with Approximation of a Constraint Region and an Epigraph for Solving Conditional Minimization Problems initial approximating sets are chosen as polyhedral sets, each iteration point is found by solving a
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© 2016, Allerton Press, Inc.For a convex programming problem we propose a solution method which
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 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
Application of the penalty method to nonstationary approximation of an optimization problemWe solve a general optimization problem, where only approximation sequences are known instead
One approach to constructing cutting algorithms with dropping of cutting planesWe propose a general cutting method for conditional minimization of continuous functions. We
A minimization method with approximation of feasible set and epigraph of objective function© 2016, Allerton Press, Inc.For a convex programming problem we propose a solution method which
Страница 1 из 32355
Фасеты
Партнеры
Индексация
