A modified simplex embedding method for solving convex optimization problems with a large amount of constraints
A. V. Kolosnitsyn
L. A. Melentiev Energy Systems Institute, Siberian Branch of the Russian Academy of Sciences, Irkutsk
A simplex embedding method adapted for solving convex optimization problems with a large amount of constraints is considered. Two modifications of the method are proposed for better performance. First of them uses a more economical approach to the residual computation for constraints, which allows one to significantly reduce the execution time of the algorithm in the case of a large amount of constraints. One of the important peculiarities of the simplex embedding method is its ability to find inactive constraints. This property of the method is used as the basis for its second modification. The numerical results obtained when solving a number of quadratic and convex nondifferentiable optimization problems show the efficiency of the proposed modifications.
simplex embedding method, convex nondifferentiable optimization, identification of inactive constraints.
PDF file (675 kB)
A. V. Kolosnitsyn, “A modified simplex embedding method for solving convex optimization problems with a large amount of constraints”, Num. Meth. Prog., 20:4 (2019), 428–437
Citation in format AMSBIB
\paper A modified simplex embedding method for solving convex optimization problems with a large amount of constraints
\jour Num. Meth. Prog.
Citing articles on Google Scholar:
Related articles on Google Scholar:
|Number of views:|