Titlebook: Mathematical Optimization Theory and Operations Research; 22nd International C Michael Khachay,Yury Kochetov,Panos Pardalos Conference proc

Blazon

0302-9743 arch, MOTOR?2023, held in Ekaterinburg, Russia, during July 2–8, 2023.?The 28 full papers and 1 short paper included in this book were carefully reviewed and selected from 89 submissions. They were organized in topical sections as follows:?Mathematical programming and applications; discrete and comb

有害

On the?Uniqueness of?Identification the?Thermal Conductivity and?Heat Capacity of?Substancengle solution, the solution of other problems is not the only one. The conditions of uniqueness of the solution to the inverse problem are formulated and justified. A class of temperature fields from the reachable sets is specified, for which the solution to the identification problem under consideration will be non-unique.

Optimum

Conference proceedings 2023R?2023, held in Ekaterinburg, Russia, during July 2–8, 2023.?The 28 full papers and 1 short paper included in this book were carefully reviewed and selected from 89 submissions. They were organized in topical sections as follows:?Mathematical programming and applications; discrete and combinatorial

裂縫

馬賽克

On Decentralized Nonsmooth Optimizationnctions lower bounds are known along with optimal algorithms. We study a specific class of problems: linear models with nonsmooth loss functions. Our algorithm combines regularization and dual reformulation to get an effective optimization method with complexity better than the lower bounds.

parasite

saphenous-vein

Phenothiazines

On the?Uniqueness of?Identification the?Thermal Conductivity and?Heat Capacity of?Substancectivity of a substance that is based on the results of experimental observation of the temperature field dynamics in the object. The algorithm is based on the first boundary value problem for a one-dimensional non-stationary heat equation. The considered inverse coefficient problem is reduced to a v

Exaggerate

Constant-Factor Approximation Algorithms for?Some Maximin Multi-clustering Problems is required to maximize the minimum cluster’s cardinality under constraint on each cluster’s scatter. The scatter is the sum of the distances from the cluster elements to the center, which is defined differently in each of the problems. We show that these problems are NP-hard in the case of an arbi

Eeg332