Solving a continuous nonlinear problem of optimal set partition with arrangement of subset centers in the case of a convex objective functional

DOI10.1007/S10559-008-0026-5zbMath1143.90389OpenAlexW1979535971MaRDI QIDQ946751

M. S. Dunaichuk, E. M. Kiselyova

Publication date: 24 September 2008

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-008-0026-5

zbMATH Keywords

nonsmooth optimizationinfinite-dimensional mathematical programmingoptimal set partition

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cites Work

• DUALITY OF CONVEX FUNCTIONS AND EXTREMUM PROBLEMS
• Unnamed Item
• Unnamed Item

This page was built for publication: Solving a continuous nonlinear problem of optimal set partition with arrangement of subset centers in the case of a convex objective functional