A modified combined relaxation method for non-linear convex variational inequalities© 2013, © 2013 Taylor & Francis. We consider a class of
non-linear problems which is intermediate
A modified combined relaxation method for non-linear convex variational inequalities© 2013, © 2013 Taylor & Francis. We consider a class of
non-linear problems which is intermediate
An Adaptive Partial Linearization Method for Optimization Problems on Product Sets© 2017, Springer Science+Business Media, LLC. We consider a general class of composite
optimization An Approximate Penalty Method with Descent for Convex Optimization Problems optimization problems, where each auxiliary penalized problem is solved approximately with a special composite
Вычисление стационарных точек в задачах двухуровневого линейного программирования.
Linear bilevel programming problems are considered, and an algorithm for computing their stationary
Modelling and performance analysis of multicast file repair in 3GPP LTE networks solve a
non-linear optimization problem for mean value of the mentioned polling interval. © Springer
An Adaptive Partial Linearization Method for Optimization Problems on Product Sets© 2017, Springer Science+Business Media, LLC. We consider a general class of composite
optimization Selective Bi-coordinate Method for Limit Non-Smooth Resource Allocation Type Problems for limit
non-smooth
optimization problems, which involve a single
linear equality and box constraints. Here