Solving the dynamic optimal set partitioning problem with arrangement of centers of subsets

DOI10.1007/s10559-014-9675-8zbMath1327.49003OpenAlexW1986010448MaRDI QIDQ891101

L. S. Koriashkina, T. A. Shevchenko, E. M. Kiseleva

Publication date: 16 November 2015

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

Full work available at URL: https://doi.org/10.1007/s10559-014-9675-8

zbMATH Keywords

optimal controldynamic systemsnumerical algorithmLagrange functionalnondifferentiable optimization methodoptimal set partitioning

Mathematics Subject Classification ID

Control problems involving ordinary differential equations (34H05) Existence theories for optimal control problems involving ordinary differential equations (49J15) Control/observation systems governed by ordinary differential equations (93C15) Optimality conditions for problems involving ordinary differential equations (49K15)

Related Items

Optimal placement of irradiation sources in the planning of radiotherapy: mathematical models and methods of solving ⋮ Solving the dynamic optimal set partitioning problem with arrangement of centers of subsets

Cites Work

• Solving the dynamic optimal set partitioning problem with arrangement of centers of subsets
• \(r\)-algorithms and ellipsoids
• An approximate method of ellipsoids
• Algorithms of nondifferentiable optimization: development and application