Titlebook: Mathematical Optimization Theory and Operations Research; 21st International C Panos Pardalos,Michael Khachay,Vladimir Mazalov Conference p

Obstreperous

放气

Arroyo

Multiple Project Scheduling for a Network Roll-Out Problem: MIP Formulation and Heuristicof Disaggregated Discrete-Time formulation with pulse start variables. Using this formulation, we propose a three-stage heuristic based on a relax and fix strategy. The effectiveness and efficiency of the proposed approach are illustrated in a series of computational experiments on real-life problem instances.

圣人

捏造

大门在汇总

忘川河

obtuse

https://doi.org/10.1007/978-3-031-09607-5artificial intelligence; combinatorial optimization; communication systems; computer networks; computer

uveitis

Noisy Zeroth-Order Optimization for Non-smooth Saddle Point Problemsthat a black-box gradient-free oracle returns an inexact function value corrupted by an adversarial noise. In this work we prove that the standard zeroth-order version of the mirror descent method is optimal in terms of the oracle calls complexity and the maximum admissible noise.

CHART

Application of the Subdifferential Descent Method to a Classical Nonsmooth Variational Problembe only subdifferentiable. Under some natural conditions the subdifferentiability of the functional considered is proved. The steepest (subdifferential) descent is found. Then the subdifferential descent method is applied to solve the initial problem. Some numerical examples demonstrate the algorithm implementation.