We study minimization of a structured objective function, being the sum of a smooth function and a composition of a weakly convex function with a linear operator. Applications include image reconstruction problems with regularizers that introduce less bias than the standard convex regularizers. We develop a variable smoothing algorithm, based on the Moreau envelope with a decreasing sequence of smoothing parameters, and prove a complexity of to achieve an -approximate solution. This bound interpolates between the bound for the smooth case and the bound for the subgradient method. Our complexity bound is in line with other works that deal with structured nonsmoothness of weakly convex functions.

In this paper, we study robust necessary optimality conditions for a nondifferentiable complex fractional programming with uncertain data. A robust counterpart of uncertain complex fractional programming is introduced in the worst-case scenario. The concept of robust optimal solution of the uncertain complex fractional programming is introduced by using robust counterpart. We give an equivalence between the optimal solutions of the robust counterpart and a minimax nonfractional parametric programming. Finally, Fritz John-type and Karush-Kuhn-Tucker-type robust necessary optimality conditions of the uncertain complex fractional programming are established under some suitable conditions.

Providing the optimal dosing strategy of a drug for an individual patient is an important task in pharmaceutical sciences and daily clinical application. We developed and validated an optimal dosing algorithm (OptiDose) that computes the optimal individualized dosing regimen for pharmacokinetic-pharmacodynamic models in substantially different scenarios with various routes of administration by solving an optimal control problem. The aim is to compute a control that brings the underlying system as closely as possible to a desired reference function by minimizing a cost functional. In pharmacokinetic-pharmacodynamic modeling, the controls are the administered doses and the reference function can be the disease progression. Drug administration at certain time points provides a finite number of discrete controls, the drug doses, determining the drug concentration and its effect on the disease progression. Consequently, rewriting the cost functional gives a finite-dimensional optimal control problem depending only on the doses. Adjoint techniques allow to compute the gradient of the cost functional efficiently. This admits to solve the optimal control problem with robust algorithms such as quasi-Newton methods from finite-dimensional optimization. OptiDose is applied to three relevant but substantially different pharmacokinetic-pharmacodynamic examples.

We present a new theoretical analysis of local superlinear convergence of classical quasi-Newton methods from the convex Broyden class. As a result, we obtain a significant improvement in the currently known estimates of the convergence rates for these methods. In particular, we show that the corresponding rate of the Broyden-Fletcher-Goldfarb-Shanno method depends only on the product of the dimensionality of the problem and the of its condition number.

The paper presents a transformation of a multi-stage optimal control model with random switching time to an age-structured optimal control model. Following the mathematical transformation, the advantages of the present approach, as compared to a standard backward approach, are discussed. They relate in particular to a compact and unified representation of the two stages of the model: the applicability of well-known numerical solution methods and the illustration of state and control dynamics. The paper closes with a simple example on a macroeconomic shock, illustrating the workings and advantages of the approach.

We study the convergence of the Riemannian steepest descent algorithm on the Grassmann manifold for minimizing the block version of the Rayleigh quotient of a symmetric matrix. Even though this problem is non-convex in the Euclidean sense and only very locally convex in the Riemannian sense, we discover a structure for this problem that is similar to geodesic strong convexity, namely, weak-strong convexity. This allows us to apply similar arguments from convex optimization when studying the convergence of the steepest descent algorithm but with initialization conditions that do not depend on the eigengap . When , we prove exponential convergence rates, while otherwise the convergence is algebraic. Additionally, we prove that this problem is geodesically convex in a neighbourhood of the global minimizer of radius .

This paper is concerned with nonconvex nonsmooth uncertain multiobjective optimization problems, in which the decision variable of both objective and constraint functions is defined on Banach space while uncertain parameters are defined on arbitrary nonempty (may not be compact) sets. We employ the Stone-C̆ech compactification of uncertainty sets and the upper semicontinuous regularization of original functions with respect to uncertain parameters, giving rise to unified robust necessary optimality conditions for the local robust weakly efficient solution of the considered problem. Moreover, we derive weak and strong KKT robust necessary conditions via the constraint qualification and the regularity condition, respectively. Several examples are provided to illustrate the validity of our results.

The main goal of this paper is to give some primal and dual Karush-Kuhn-Tucker second-order necessary conditions for the existence of a strict local Pareto minimum of order two for an inequality-constrained multiobjective optimization problem. Dual Karush-Kuhn-Tucker second-order sufficient conditions are provided too. We suppose that the objective function and the active inequality constraints are only locally Lipschitz in the primal necessary conditions and only strictly differentiable in sense of Clarke at the extremum point in the dual conditions. Examples illustrate the applicability of the obtained results.

Enhanced index tracking problem is the issue of selecting a tracking portfolio to outperform the benchmark return with a minimum tracking error. In this paper, we address the enhanced index tracking problem based on uncertainty theory where stock returns are treated as uncertain variables instead of random variables. First, we propose a nonlinear uncertain optimization model, i.e., uncertain mean-absolute downside deviation enhanced index tracking model. Then, we give the analytical solution of the proposed optimization model when stock returns take linear uncertainty distributions. Based on the solution, we find that tracking portfolio frontier is a continuous curve composed of at most different line segments. Furthermore, we give the condition that tracking portfolio return and risk increase with benchmark return and risk, respectively. Finally, we offer some experiments and show that our proposed model is effective in controlling the tracking error.

We revisit the optimal control problem with maximum cost with the objective to provide different equivalent reformulations suitable to numerical methods. We propose two reformulations in terms of extended Mayer problems with state constraints, and another one in terms of a differential inclusion with upper-semi-continuous right member without state constraint. For the latter we also propose a scheme that approximates from below the optimal value. These approaches are illustrated and discussed in several examples.

Since the global COVID-19 pandemic in 2020, some people who have dropped out of online game have become re-addicted to it due to the order of stay-at-home, making the phenomenon of online game addiction even worse. Controlling the prevalence of online game addiction is of great significance to protect people's healthy life. For this purpose, a mathematical model of online game addiction with incomplete recovery and relapse is established. First, we analyze the basic properties of the model and obtain the expression of the basic reproduction number and all equilibria. By constructing suitable Lyapunov functions, the global asymptotical stability of the equilibria are proved. Then in the numerical simulation, we use the least squares estimation method to fit the real data of e-sports users in China from 2010 to 2020, and obtain the estimated value of all parameters. The approximation value of the basic reproduction number is obtained as . The result reflects that the spread of game addiction in China is very serious. The stability of the equilibria are proved by using the estimated parameter values. Finally, the simulation results between with control and without control during 2020 to 2050 are compared, and the optimal control strategy is found by comparing the total infectious people. The results of optimal control suggest that if we increase our continuous attention to incompletely recovered people, we can prevent more people from becoming addicted to games. The findings in this paper reveal new mechanisms of game addiction transmission and demonstrate a more detailed and reliable control strategy.

Efficient global optimization is a widely used method for optimizing expensive black-box functions. In this paper, we study the worst-case oracle complexity of the efficient global optimization problem. In contrast to existing kernel-specific results, we derive a unified lower bound for the oracle complexity of efficient global optimization in terms of the metric entropy of a ball in its corresponding reproducing kernel Hilbert space. Moreover, we show that this lower bound nearly matches the upper bound attained by non-adaptive search algorithms, for the commonly used squared exponential kernel and the Matérn kernel with a large smoothness parameter . This matching is up to a replacement of /2 by and a logarithmic term , where is the dimension of input space, is the upper bound for the norm of the unknown black-box function, and is the desired accuracy. That is to say, our lower bound is nearly optimal for these kernels.

In a Hilbert setting we aim to study a second order in time differential equation, combining viscous and Hessian-driven damping, containing a time scaling parameter function and a Tikhonov regularization term. The dynamical system is related to the problem of minimization of a nonsmooth convex function. In the formulation of the problem as well as in our analysis we use the Moreau envelope of the objective function and its gradient and heavily rely on their properties. We show that there is a setting where the newly introduced system preserves and even improves the well-known fast convergence properties of the function and Moreau envelope along the trajectories and also of the gradient of Moreau envelope due to the presence of time scaling. Moreover, in a different setting we prove strong convergence of the trajectories to the element of minimal norm from the set of all minimizers of the objective. The manuscript concludes with various numerical results.

The aim of this article is to understand how to apply partial or total containment to SIR epidemic model during a given finite time interval in order to minimize the epidemic final size, that is the cumulative number of cases infected during the complete course of an epidemic. The existence and uniqueness of an optimal strategy are proved for this infinite-horizon problem, and a full characterization of the solution is provided. The best policy consists in applying the maximal allowed social distancing effort until the end of the interval, starting at a date that is not always the closest date and may be found by a simple algorithm. Both theoretical results and numerical simulations demonstrate that it leads to a significant decrease in the epidemic final size. We show that in any case the optimal intervention has to begin before the number of susceptible cases has crossed the herd immunity level, and that its limit is always smaller than this threshold. This problem is also shown to be equivalent to the minimum containment time necessary to stop at a given distance after this threshold value.

In this paper, we study the competition of healthcare institutions for medical supplies in emergencies caused by natural disasters. In particular, we develop a two-stage procurement planning model in a random environment. We consider a pre-event policy, in which each healthcare institution seeks to minimize the purchasing cost of medical items and the transportation time from the first stage, and a recourse decision process to optimize the expected overall costs and the penalty for the prior plan, in response to each disaster scenario. Thus, each institution deals with a two-stage stochastic programming model that takes into account the unmet demand at the first stage, and the consequent penalty. Then, the institutions simultaneously solve their own stochastic optimization problems and reach a stable state governed by the stochastic Nash equilibrium concept. Moreover, we formulate the problem as a variational inequality; both the discrete and the general probability distribution cases are described. We also present an alternative formulation using infinite-dimensional duality tools. Finally, we discuss some numerical illustrations applying the progressive hedging algorithm.

We review and discuss results obtained through an application of tools of nonlinear optimal control to biomedical problems. We discuss various aspects of the modeling of the dynamics (such as growth and interaction terms), modeling of treatment (including pharmacometrics of the drugs), and give special attention to the choice of the objective functional to be minimized. Indeed, many properties of optimal solutions are predestined by this choice which often is only made casually using some simple ad hoc heuristics. We discuss means to improve this choice by taking into account the underlying biology of the problem.

This article deals with an economic production quantity (EPQ) model with deterioration under the effect of environmental pollution in fuzzy environment. First of all, we develop a pollution generation (PG) model with the help of existing initial pollution status of the environment, and then we use it as an essential constraint in the proposed EPQ model. The model has also been studied in two different scenarios: (a) when unit selling price is given and (b) when unit selling price is associated with marginal profit respectively. However, in this article, the concept of manpower exploitation, law of surplus value and their impacts on profit function has been discussed. In fact, after the invention of Marxian production theory (1867), not a single article has been developed for studying inventory management problems/operations research using this theory. Thus, in this study, focussing Marxian principle we have developed a new production inventory model named Marxian economic production quantity (M-EPQ) model incorporating the extensions of the models developed by Harris (Mag Manag 10(2):135-136, 1913) and Taft (Iron Age 101:1410-1412, 1918) exclusively. Moreover, to deal with the non-random uncertainties of several cost components of production process we have utilized fuzzy system explicitly. A case study has been performed for numerical illustrations and we have developed a solution algorithm for numerical computations. Finally, sensitivity analysis and graphical illustrations are made to validate the new M-EPQ model followed by a conclusion.

In this paper, we study derivatives of powers of Euclidean norm. We prove their Hölder continuity and establish explicit expressions for the corresponding constants. We show that these constants are optimal for odd derivatives and at most two times suboptimal for the even ones. In the particular case of integer powers, when the Hölder continuity transforms into the Lipschitz continuity, we improve this result and obtain the optimal constants.

In this paper, we study the iteration complexity of cubic regularization of Newton method for solving composite minimization problems with uniformly convex objective. We introduce the notion of second-order condition number of a certain degree and justify the linear rate of convergence in a nondegenerate case for the method with an adaptive estimate of the regularization parameter. The algorithm automatically achieves the best possible global complexity bound among different problem classes of uniformly convex objective functions with Hölder continuous Hessian of the smooth part of the objective. As a byproduct of our developments, we justify an intuitively plausible result that the global iteration complexity of the Newton method is always better than that of the gradient method on the class of strongly convex functions with uniformly bounded second derivative.

A general class of nonconvex optimization problems is considered, where the penalty is the composition of a linear operator with a nonsmooth nonconvex mapping, which is concave on the positive real line. The necessary optimality condition of a regularized version of the original problem is solved by means of a monotonically convergent scheme. Such problems arise in continuum mechanics, as for instance cohesive fractures, where singular behaviour is usually modelled by nonsmooth nonconvex energies. The proposed algorithm is successfully tested for fracture mechanics problems. Its performance is also compared to two alternative algorithms for nonsmooth nonconvex optimization arising in optimal control and mathematical imaging.

In this paper, we characterize Lipschitzian properties of different multiplier-free and multiplier-dependent perturbation mappings associated with the stationarity system of a so-called generalized nonlinear program popularized by Rockafellar. Special emphasis is put on the investigation of the isolated calmness property at and around a point. The latter is decisive for the locally fast convergence of the so-called semismooth* Newton-type method by Gfrerer and Outrata. Our central result is the characterization of the isolated calmness at a point of a multiplier-free perturbation mapping via a combination of an explicit condition and a rather mild assumption, automatically satisfied e.g. for standard nonlinear programs. Isolated calmness around a point is characterized analogously by a combination of two stronger conditions. These findings are then related to so-called criticality of Lagrange multipliers, as introduced by Izmailov and extended to generalized nonlinear programming by Mordukhovich and Sarabi. We derive a new sufficient condition (a characterization for some problem classes) of nonexistence of critical multipliers, which has been also used in the literature as an assumption to guarantee local fast convergence of Newton-, SQP-, or multiplier-penalty-type methods. The obtained insights about critical multipliers seem to complement the vast literature on the topic.