Using of modified simplex imbeddings method for solving special class of convex non-differentiable optimization problems

zbMath1346.90666MaRDI QIDQ307853

Anton Vasilevich Kolosnitcyn

Publication date: 5 September 2016

Published in: Izvestiya Irkutskogo Gosudarstvennogo Universiteta. Seriya Matematika (Search for Journal in Brave)

Full work available at URL: http://isu.ru/journal/downloadArticle?article=_5b81a0543e4e4793a07f7d96b1e8b2a6&lang=rus

zbMATH Keywords

modified simplex imbeddings methodresulting cutting planesubdifferential of convex functions

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (1)

Computational efficiency of the simplex embedding method in convex nondifferentiable optimization

Uses Software

• PLCP
• SQPlab

Cites Work

• Numerical results for a globalized active-set Newton method for mixed complementarity problems
• Numerical optimization. Theoretical and practical aspects. Transl. from the French
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Using of modified simplex imbeddings method for solving special class of convex non-differentiable optimization problems