In this paper, a new self-adaptive step size algorithm to approximate the solution of the split minimization problem and the fixed point problem of nonexpansive mappings was constructed, which combined the proximal algorithm and a modified Mann’s ite...
In this work, we aim to investigate the convex minimization problem of the sum of two objective functions. This optimization problem includes, in particular, image reconstruction and signal recovery. We then propose a new modified forward-backward sp...
The underlying function in reproducing kernel Hilbert space (RKHS) may be degraded by outliers or deviations, resulting in a symmetry ill-posed problem. This paper proposes a nonconvex minimization model with
This paper considers a 1D time-domain inverse scattering problem for the Helmholtz equation in which penetrable scatterers are to be determined from boundary measurements of the scattering data. It is formulated as a coefficient identification proble...
This paper is devoted to studying the influence of the structure of a complex system on its integral risk. When solving risk management problems, it often becomes necessary to take into account structural effects, which most often include risk transf...
In this paper, we consider the single-machine scheduling problem with given release dates and the objective to minimize the maximum penalty which is NP-hard in the strong sense. For this problem, we introduce a dual and an inverse problem and show th...
Fuzzy variational problems have received significant attention over the past decade due to a number of successful applications in fields such as optimal control theory and image segmentation. Current literature on fuzzy variational problems focuses o...
Multistep composite implicit and explicit extragradient-like schemes are presented for solving the minimization problem with the constraints of variational inclusions and generalized mixed equilibrium problems. Strong convergence results of introduce...
We provide an alternative formulation of proximal split minimization problems, a very recently developed and appealing strategy that relies on an infimal post-composition approach. Then, forward–backward and Douglas–Rachford splitting alg...
In algorithm development, symmetry plays a vital part in managing optimization problems in scientific models. The aim of this work is to propose a new accelerated method for finding a common point of convex minimization problems and then use the fixe...
Recently, a great amount of attention has been focused on the study of fractional and nonlocal operators of the elliptic type both for pure mathematical research and in view of concrete real-world applications. We are interested in proving the existe...
In this paper, we propose a new accelerated common fixed-point algorithm for two countable families of G-nonexpansive mappings. Weak convergence results are obtained in the context of directed graphs in real Hilbert spaces. As applications, we apply...
We prove the existence of radially symmetric solutions and the validity of Euler–Lagrange necessary conditions for a class of variational problems with slow growth. The results are obtained through the construction of suitable superlinear pertu...
Finding an optimal solution of the min-max programming problem with addition-overlap function constraints has been studied in the literature. Since the definition of overlap functions is very general and has no explicit formulations, a bisection meth...
For the past few decades, various algorithms have been proposed to solve convex minimization problems in the form of the sum of two lower semicontinuous and convex functions. The convergence of these algorithms was guaranteed under the L-Lipschitz co...
The purpose of this work is to construct iterative methods for solving a split minimization problem using a self-adaptive step size, conjugate gradient direction, and inertia technique. We introduce and prove a strong convergence theorem in the frame...
A new accelerated algorithm for approximating the common fixed points of a countable family of G-nonexpansive mappings is proposed, and the weak convergence theorem based on our main results is established in the setting of Hilbert spaces with a symm...
In this paper, we propose two novel inertial forward–backward splitting methods for solving the constrained convex minimization of the sum of two convex functions,
To gain more competitive advantages and attract more customers from the turbulent business environment, manufacturing firms today must offer a wide variety of products to marketplaces. The existence of component commonality in multi-product fabricati...
Given several nonnegative matrices with a single pattern of allocation among their zero/nonzero elements, the average matrix should have the same pattern as well. This is the first tenet of the pattern-multiplicative average (PMA) concept, while the...
In this paper, we introduce an iterative scheme with inertial effect using Mann iterative scheme and gradient-projection for solving the bilevel variational inequality problem over the intersection of the set of common fixed points of a finite number...
The Solution of the Subproblem of the Cutting Angle Method of Global Optimization for problems of minimizing increasing Positively Homogeneous of degree one functions is proved to be NP-Complete. For the proof of this fact we formulate another proble...
This paper presents a comprehensive approach for minimizing makespan in the challenging two-stage hybrid flowshop with dedicated machines, a problem known to be strongly NP-hard. This study proposed a constraint programming approach, a novel heuristi...
Cost reduction and staff retention are important optimization objectives in home healthcare (HHC) systems. Home healthcare operators need to balance their objectives by optimizing resource use, service delivery and profits. Minimizing total travel di...
The growth in containerized shipping has led to the expansion of seaports, resulting in the emergence of multiple terminals. While multi-terminal systems increase port capacity, they also pose significant challenges to container transportation, parti...
In this research, for a given time interval, which is the general period of melanoma treatment, a bilinear control model is considered, given by a system of differential equations, which describes the interaction between drug-sensitive and drug-resis...
In this paper, based on the very recent work by Nandal et al. (Nandal, A.; Chugh, R.; Postolache, M. Iteration process for fixed point problems and zeros of maximal monotone operators. Symmetry 2019, 11, 655.), we propose a new generalized viscosity...
We consider a finite horizon multi-model linear-quadratic optimal control problem. For this problem, we treat the case where the problem’s functional does not contain a control function. The latter means that the problem under consideration is...
In this paper, a new algorithm for finding a common element of a split equality fixed point problem for nonexpansive mappings and split equality equilibrium problem in three Banach spaces is introduced. Also, some strong and weak convergence theorems...
The optimal control currently decides the minimum energy consumption within the problems attached to subways. Among other things, we formulate and solve an optimal bi-control problem, the two controls being the acceleration and the feed-back of a Rie...
The no idle permutation flow shop scheduling problem (NIPFSP) is a popular NP-hard combinatorial optimization problem, which exists in several real world production processes. This study proposes a novel hybrid estimation of the distribution algorith...
In this paper, we investigate the existence and uniqueness of minimizers of a fractional variational problem generalized from the energy functional associated with a cantilever beam under a uniformly distributed load. We apply the fractional Euler&nd...
In the pursuit of finding subclasses of the makespan minimization problem on unrelated parallel machines that have approximation algorithms with approximation ratio better than 2, the graph balancing problem has been of current interest. In the graph...
In this work, we investigate a minimization problem with a convex objective function on a domain, which is the solution set of a common fixed point problem with a finite family of nonexpansive mappings. Our algorithm is a combination of a projected s...
Convergence results of the subgradient algorithm for equilibrium problems were mainly obtained using a Lipschitz continuity assumption on the given bifunctions. In this paper, we first provide a complexity result for monotone equilibrium problems wit...
In this paper, we introduce the new concepts of K-adjustability convexity and strictly K-adjustability convexity which respectively generalize and extend the concepts of K-convexity and strictly K-convexity. We establish some new existence and unique...
This paper addresses the Flexible Job Shop Scheduling Problem (FJSP) with the objective of minimizing both earliness/tardiness (E/T) and intermediate storage time (IST). An extended S-graph framework that incorporates E/T and IST minimization while m...
In this paper, we present a new self-adaptive inertial projection method for solving split common null point problems in p-uniformly convex and uniformly smooth Banach spaces. The algorithm is designed such that its convergence does not require prior...
This paper investigated the periodic and quasi-periodic orbits in the symmetric collinear four-body problem through a variational approach. We analyze the conditions under which homographic solutions minimize the action functional. We compute the min...
A convex minimization problem in the form of the sum of two proper lower-semicontinuous convex functions has received much attention from the community of optimization due to its broad applications to many disciplines, such as machine learning, regre...
In this paper, we introduced an inertial extragradient algorithm to approximate the common solution of split fixed point, split variational inclusion and split equilibrium problems involving nonexpansive mappings and pseudomonotone Lipschitz-type bif...
Renewable energy sources are environmentally friendly and cost-efficient. However, the problem with these renewable resources is their heavy reliance on weather conditions. Thus, at times, these solutions are not guaranteed to meet the required deman...
The quickest path problem in multistate flow networks, which is also known as the quickest path reliability problem (QPRP), aims at calculating the probability of successfully sending a minimum of d flow units/data/commodity from a source node to a d...
This article deals with the modified Multi-Depot Vehicle Routing Problem (MDVRP). The modification consists of altering the optimization criterion. The optimization criterion of the standard MDVRP is to minimize the total sum of routes of all vehicle...
In each iteration, the projection methods require computing at least one projection onto the closed convex set. However, projections onto a general closed convex set are not easily executed, a fact that might affect the efficiency and applicability o...
In this paper, optimality conditions are studied for a new class of PDE and PDI-constrained scalar variational control problems governed by path-independent curvilinear integral functionals. More precisely, we formulate and prove a minimal criterion...
In this article, we introduce a novel averaged-type iterative scheme designed for solving convex minimization problems over the set of common fixed points of a pair of demicontractive mappings. Under suitable assumptions, we prove that the proposed a...
In this contribution, we consider the problem of finding the minimal Euclidean distance between a given converging decreasing one-dimensional array X in (R+)∞ and arrays of the form
This paper provides a uniform boundedness theorem for a class of convex operators, such as Banach–Steinhaus theorem for families of continuous linear operators. The case of continuous symmetric sublinear operators is outlined. Second, a general...
We consider online algorithms with respect to the competitive ratio. In this paper, we explore one-way automata as a model for online algorithms. We focus on quantum and classical online algorithms. For a specially constructed online minimization pro...
of 202