Cutting-plane method with embedding of epigraphs of auxiliary functions© 2017 IEEE. We propose a
method of conditional minimization of convex functions from the class
One cutting plane algorithm using auxiliary functions programming problem from the class of cutting
methods. The algorithm is characterized by the construction
A version of the penalty method with approximation of the epigraphs of auxiliary functions© 2019, Kazan Federal University. All rights reserved. A
method for solving the convex programming
The method of multipliers for nonlinearly constrained variational inequalitiesThe
method of multipliers for variational inequalities with nonstrictly monotone cost mappings
Partial linearization method for network equilibrium problems with elastic demands of this
method is a partially linearized
auxiliary problem. We propose a simple solution
method for the
auxiliary On the existence of a solution of one variational inequality of the nonlinear filtration theory of the
auxiliary problem is established by means of using the semidiscretization
method with a penalty