Class Of Problems Research Articles

Necessary and sufficient condition for existence for a case of eigenvalues of multiplicity two

We establish necessary and sufficient condition for existence of solutions for a class of semilinear Dirichlet problems with the linear part at resonance at eigenvalues of multiplicity two. The result is applied to give a condition for unboundness of all solutions of the corresponding semilinear heat equation.
 For more information see https://ejde.math.txstate.edu/Volumes/2024/09/abstr.html

A novel stepsize for gradient descent method

We propose a novel adaptive stepsize for the gradient descent scheme to solve unconstrained nonlinear optimization problems. With the convex and smooth objective satisfying locally Lipschitz gradient we obtain the complexity O(1k) of f(xk)−f⁎ at most. By using the idea of the new stepsize, we propose another new algorithm based on the projected gradient for solving a class of nonconvex optimization problems over a closed convex set. The computational experiments show the efficiency of the new method.

Deep neural-network prior for orbit recovery from method of moments

Orbit recovery problems are a class of problems that often arise in practice and various forms. In these problems, we aim to estimate an unknown function after being distorted by a group action and observed via a known operator. Typically, the observations are contaminated with a non-trivial level of noise. Two particular orbit recovery problems of interest in this paper are multireference alignment and single-particle cryo-EM modeling. In order to suppress the noise, we suggest using the method of moments approach for both problems while introducing deep neural network priors. In particular, our neural networks should output the signals and the distribution of group elements, with moments being the input. In the multireference alignment case, we demonstrate the advantage of using the NN to accelerate the convergence for the reconstruction of signals from the moments. Finally, we use our method to reconstruct simulated and biological volumes in the cryo-EM setting.

On Tempered (κ, ψ)-Hilfer Fractional Boundary Value Problems

Our research is primarily focused on applying the tempered (κ, ψ)-fractional operators to investigate the existence, uniqueness, and κ-Mittag-Leffler-Ulam-Hyers stability of a specific class of boundary value problems involving implicit nonlinear fractional differential equations and tempered (κ, ψ)-Hilfer fractional derivatives. To accomplish this, we make use of the fixed point theorem of Banach and a generalization of the well-known Gronwall inequality. Additionally, we provide illustrative examples to demonstrate the practical effectiveness of our main findings.

Sailing league problems

AbstractWe describe a class of combinatorial design problems which typically occur in professional sailing league competitions. We discuss connections to resolvable block designs and equitable coverings and to scheduling problems in operations research. We in particular give suitable boolean quadratic and integer linear optimization problem formulations, as well as further heuristics and restrictions, that can be used to solve sailing league problems in practice. We apply those techniques to three case studies obtained from real sailing leagues and compare the results with previously used tournament plans.

Fast Sampling via Spectral Independence Beyond Bounded-degree Graphs

Spectral independence is a recently developed framework for obtaining sharp bounds on the convergence time of the classical Glauber dynamics. This new framework has yielded optimal O(n log n) sampling algorithms on bounded-degree graphs for a large class of problems throughout the so-called uniqueness regime, including, for example, the problems of sampling independent sets, matchings, and Ising-model configurations. Our main contribution is to relax the bounded-degree assumption that has so far been important in establishing and applying spectral independence. Previous methods for avoiding degree bounds rely on using L p -norms to analyse contraction on graphs with bounded connective constant (Sinclair, Srivastava, and Yin, FOCS’13). The non-linearity of L p -norms is an obstacle to applying these results to bound spectral independence. Our solution is to capture the L p -analysis recursively by amortising over the subtrees of the recurrence used to analyse contraction. Our method generalises previous analyses that applied only to bounded-degree graphs. As a main application of our techniques, we consider the random graph G (n, d/n) , where the previously known algorithms run in time n O (log d ) or applied only to large d . We refine these algorithmic bounds significantly, and develop fast nearly linear algorithms based on Glauber dynamics that apply to all constant d , throughout the uniqueness regime.

Minimizing Total Completion Time, Total Earliness Time, and Maximum Tardiness for a Single Machine scheduling problem

Machine scheduling problems (MSP) are considered as one of the most important classes of combinatorial optimization problems. In this paper, the problem of job scheduling on a single machine is studied to minimize the multiobjective and multiobjective objective function. This objective function is: total completion time, total lead time and maximum tardiness time, respectively, which are formulated as are formulated. In this study, a mathematical model is created to solve the research problem. This problem can be divided into several sub-problems and simple algorithms have been found to find the solutions to these sub-problems and compare them with efficient solutions. For this problem, some rules that provide efficient solutions have been proved and some special cases have been introduced and proved since the problem is an NP-hard problem to find some efficient solutions that are efficient for the discussed problem 1// and good or optimal solutions for the multi-objective functions 1// ,, and emphasize the importance of the dominance rule (DR), which can be applied to this problem to improve efficient solutions.

Existence of solution sets for Φ-Laplacian for random impulsive differential equations

In this article, we provide results on the existence and compactness of the set of solutions for a class of initial-value problem representing a first-order random impulsive differential equation. The key tool to achieve our goal is based on an alternative nonlinear Leary-Schauder type theorem in the settings of generalized Banach spaces.

On existence of solutions for some classes of elliptic problems with supercritical exponential growth

On existence of solutions for some classes of elliptic problems with supercritical exponential growth

Uniform estimates for conforming Galerkin method for anisotropic singularly perturbed elliptic problems

In this article, we study some anisotropic singular perturbations for a class of linear elliptic problems. A uniform estimates for conforming Q 1 finite element method are derived, and some other results of convergence and regularity for the continuous problem are proved. The arguments are based on the tensorization trick and standard elliptic regularity theory tools.

Equivariant volume extremization and holography

In a previous paper two of us (D.M. and A.Z.) proposed that a vast class of gravitational extremization problems in holography can be formulated in terms of the equivariant volume of the internal geometry, or of the cone over it. We substantiate this claim by analysing supergravity solutions corresponding to branes partially or totally wrapped on a four-dimensional orbifold, both in M-theory as well as in type II supergravities. We show that our approach recovers the relevant gravitational central charges/free energies of several known supergravity solutions and can be used to compute these also for solutions that are not known explicitly. Moreover, we demonstrate the validity of previously conjectured gravitational block formulas for M5 and D4 branes. In the case of M5 branes we make contact with a recent approach based on localization of equivariant forms, constructed with Killing spinor bilinears.

Besov regularity for a class of elliptic obstacle problems with double-phase Orlicz growth

In this paper, we consider local Besov regularity of to the elliptic variational inequality with double-phase Orlicz growth:∫Ω〈A(x,Du),D(u−φ)〉dx≤∫Ω〈B(x,F),D(u−φ)〉dx∀φ∈Kψ(Ω), where Kψ(Ω) is an admissible set constrained by an obstacle function ψ(x). Here, each of nonlinearities A and B is supposed to be (Φ1,Φ2) double-phase with Orlicz type growth, respectively, under the assumption supt∈R+⁡Φ2(t)Φ1(t)+Φ11+α/n(t)<+∞ for a Hölder exponent α∈(0,1] of the coefficient a(x). We prove that a fractional differentiability of Du is reflected by extra differentiability assumption on the obstacle function and the external force, under a suitable regularity on the coefficient 0≤a(x)∈C0,α(Ω). This is an extension of recent work [44] from the elliptic problems of (p,q) growth to the setting of double phase Orlicz growth.

A numerical method for solutions of tempered fractional differential equations

The main objective of this paper is to develop a technique for approximating the numerical solution of certain class of tempered fractional differential equations. The proposed technique is based on the Newton–Cotes quadrature formula, and it is established by using generalized Lagrange interpolation polynomials. The product integration technique is used to develop a formula for the left and right-sided tempered fractional integrals. Next, by using these formulas, a method is developed for solving a general class of tempered fractional differential equations. Furthermore, three distinct classes of initial value problems and one of the terminal value problems for tempered fractional differential equations are taken into consideration and each class is illustrated by a numerical experiment to demonstrate the validity and effectiveness of the proposed methodology. Moreover, upper bound of error in the numerical approximations have been provided.

Using common redundancy components for suppliers in a supply chain network design problem considering energy costs and environmental effects

Improving the reliability of factories and suppliers through appropriate allocation of redundancy components is crucial in responding to customer demand. However, if individual factories independently buy and allocate redundancy components, huge investments will be required. To optimize the reliability level and costs of the supply chain network, the present study allocates these components to suppliers based on customer demand. While allocating redundancy components to factories improves the chain's reliability, it increases energy consumption and greenhouse gas emissions. Therefore, a balance between cost, reliability, and pollution needs to be established. The study considers a three-level supply chain, including the supplier (factories), distributor, and retailer, with stochastic and normally distributed demand assumed for each retailer. To address demand fluctuations, the risk pooling effect is implemented. As the problem belongs to the class of NP-hard problems, the study develops three multi-objective meta-heuristic algorithms, namely Non-dominated Sorting Genetic Algorithm II (NSGAII), Archived Multi-Objective Simulated Annealing (AMOSA), and Multi-Objective Artificial Bee Colony (MOABC) to solve it. The performance of these algorithms is evaluated using the results of the complete enumeration method. The comparison results based on six multi-objective performance metrics show that the MOABC algorithm has better performance in finding high-quality solutions in less time, while the NSGAII algorithm provides more diverse Pareto optimal solutions.

Locally unitarily invariantizable NEPv and convergence analysis of SCF

We consider a class of eigenvector-dependent nonlinear eigenvalue problems (NEPv) without the unitary invariance property. Those NEPv commonly arise as the first-order optimality conditions of a particular type of optimization problems over the Stiefel manifold, and previously, special cases have been studied in the literature. Two necessary conditions, a definiteness condition and a rank-preserving condition, on an eigenbasis matrix of the NEPv that is a global optimizer of the associated optimization problem are revealed, where the definiteness condition has been known for the special cases previously investigated. We show that, locally close to the eigenbasis matrix satisfying both necessary conditions, the NEPv can be reformulated as a unitarily invariant NEPv, the so-called aligned NEPv, through a basis alignment operation — in other words, the NEPv is locally unitarily invariantizable. Numerically, the NEPv is naturally solved by a self-consistent field (SCF)-type iteration. By exploiting the differentiability of the coefficient matrix of the aligned NEPv, we establish a closed-form local convergence rate for the SCF-type iteration and analyze its level-shifted variant. Numerical experiments confirm our theoretical results.

Unified Branch-and-Benders-Cut for two-stage stochastic mixed-integer programs

Two-stage stochastic programs are a class of stochastic problems where uncertainty is discretized into scenarios, making them amenable to solution approaches such as Benders decomposition. However, classic Benders decomposition is not applicable to general two-stage stochastic mixed-integer programs due to the restriction that the second-stage variables should be continuous. We propose a novel Benders decomposition-based framework that accommodates mixed-integer variables in both stages as well as uncertainty in all of the recourse parameters. The proposed approach is a unified branch-and-Benders algorithm, where we use a heuristic to maintain a global upper bound and a post-processing phase to determine an optimal solution. This new approach is flexible, allowing practitioners to integrate acceleration techniques such as partial decomposition or convexification schemes. We demonstrate the efficiency of our approach versus classic ones on the stochastic server location problem, and its generality on a new, complex stochastic problem where the second stage is a traveling salesman problem.

On semidefinite programming relaxations for a class of robust SOS-convex polynomial optimization problems

On semidefinite programming relaxations for a class of robust SOS-convex polynomial optimization problems

Heuristic Ensemble Construction Methods of Automatically Designed Dispatching Rules for the Unrelated Machines Environment

Dynamic scheduling represents an important class of combinatorial optimisation problems that are usually solved with simple heuristics, the so-called dispatching rules (DRs). Designing efficient DRs is a tedious task, which is why it has been automated through the application of genetic programming (GP). Various approaches have been used to improve the results of automatically generated DRs, with ensemble learning being one of the best-known. The goal of ensemble learning is to create sets of automatically designed DRs that perform better together. One of the main problems in ensemble learning is the selection of DRs to form the ensemble. To this end, various ensemble construction methods have been proposed over the years. However, these methods are quite computationally intensive and require a lot of computation time to obtain good ensembles. Therefore, in this study, we propose several simple heuristic ensemble construction methods that can be used to construct ensembles quite efficiently and without the need to evaluate their performance. The proposed methods construct the ensembles solely based on certain properties of the individual DRs used for their construction. The experimental study shows that some of the proposed heuristic construction methods perform better than more complex state-of-the-art approaches for constructing ensembles.

Sustainable decision making based on systems integration and decision support system promoting endorheic basin sustainability

Sustainability has become a target in official policy rhetoric. However, the gap between scientific investigation and practical decision-making poses a significant challenge in achieving sustainability, particularly in endorheic regions. Addressing this challenge requires the translation of scientific outcomes into available decision-making information. In this study, we propose a sustainable decision-making methodology, namely, decision rehearsal, that has four stages: the scientification of decision-making problems, the politicization of scientific knowledge, the translation of scientific findings into decision-making information, and the translation of decision-making information into policy action. Based on this theoretical framework, an ensemble artifact, referred to as the River Basin Sustainable Development Decision Support System (RSDSS), was designed, built and evaluated from a design science research perspective to address a class of sustainability problems in endorheic basins. This system integrates a watershed-integrated model, disaggregated sustainable development goals (SDGs), localized shared socioeconomic pathways (SSPs), and a sustainability assessment model, which can assist decision- and policy-makers in more deeply understand the impacts of different policy assumptions on the interactions between human and natural systems and watershed sustainability. Some related RSDSS cases are discussed to demonstrate the ability of the RSDSS to resolve complex watershed problems, which implies that the RSDSS can promote sustainable river basin management.

On the S-asymptotically ω-periodic mild solutions for multi-term time fractional measure integro-differential equations

This paper deals with a class of nonlocal problem for multi-term time-fractional measure integro-differential evolution equations of mixed type in Hilbert spaces. Firstly, we introduce the concept of S-asymptotically ω-periodic mild solution, on the premise of by utilizing -resolvent family and measure functional (Henstock–Lebesgue–Stieltjes integral). Secondly, combining regulated functions and fixed point theorem, the existence S-asymptotically ω-periodic mild solution for a classes of measure-driven differential equation is discussed. Finally, as samples of applications, we consider the nonlocal problem to a class of time-fractional measure partial differential equation with nonlocal condition at the end of this paper.