Search Results

This paper is concerned with the optimality and duality for a class of nonconvex fuzzy optimization problems under granular differentiability. We first derive optimality conditions for fuzzy optimization problems with fuzzy inequality constraints ...

In this paper, we determine the dual codes of cyclic codes of length p s over R 3 = F p m [ u ] 〈 u 3 〉, where p is a prime number and u 3 = 0. Also, we improve and give correction of the results stated by B. Kim and J. Lee (2020) in [11]. ...

In this paper, we introduce a new approximation approach for a class of multiobjective programming problems in complex spaces and their duals. Using a sublinear functional, an approximated problem is constructed at a given feasible solution of ...

Bilevel optimization problems embed the optimality of a subproblem as a constraint of another optimization problem. We introduce the concept of near-optimality robustness for bilevel optimization, protecting the upper-level solution feasibility ...

Göring–Helmberg–Wappler introduced optimization problems regarding embeddings of a graph into a Euclidean space and the first nonzero eigenvalue of the Laplacian of a graph, which are dual to each other in the framework of semidefinite ...${}_{\mathrm{}}$

In real life, multiple issues may have different weights in leading to conflicts. Some of the existing conflict analysis literature related to weight does not involve an explicit weight method, and some use common methods such as entropy weight ...

In kernel-based approximation, it is well-known that the direct approach to interpolation is prone to ill-conditioning of the interpolation matrix. One simple idea is to use other better-conditioned bases that span the same space of the ...

A graph parameter is self-dual in some class of graphs embeddable in some surface if its value does not change in the dual graph by more than a constant factor. We prove that, in the class of connected hypergraphs without bridges and loops that ...

This article explores additive codes with one-rank hull, offering key insights and constructions. The article introduces a novel approach to finding one-rank hull codes over finite fields by establishing a connection between self-orthogonal ...

In this paper, we study a robust optimization problem whose constraints include nonsmooth and nonconvex functions and the intersection of closed sets. Using advanced variational analysis tools, we first provide necessary conditions for the ...

Regularized learning problems in Banach spaces, which often minimize the sum of a data fidelity term in one Banach norm and a regularization term in another Banach norm, is challenging to solve. We construct a direct sum space based on the Banach ...

In this paper, we first consider the existence conditions, the construction and the enumeration of Hermitian self-dual $\theta$-cyclic and $\theta$-negacyclic codes over ${\mathrm{I}\mathrm{F}}_{p^2}$, where p is a prime number and $\theta$ is the Frobenius automorphism over ${\mathrm{I}\mathrm{F}}_{p^2}$. We then give ...$$$$${\mathrm{}\mathrm{}}_{{}^{}}$

This note communicates a simple modification of the optimality criteria (OC) design update—as found in well-known Matlab implementations of the classical topology design problem—to an update based on a quadratic program (QP) with a single linear ...

This paper is devoted to the study of a class of multiobjective semi-infinite programming problems on Hadamard manifolds (in short, (MOSIP-HM)). We derive some alternative theorems analogous to Tucker’s theorem, Tucker’s first and second existence ...

We consider an investor who is dynamically informed about the future evolution of one of the independent Brownian motions driving a stock’s price fluctuations. With linear temporary price impact the resulting optimal investment problem with ...

This paper provides the Generalized Mattson Solomon polynomial for repeated-root polycyclic codes over local rings that gives an explicit decomposition of them in terms of idempotents. It also states some structural properties of repeated-root ...

In this paper, weakly nondominated solutions of set-valued optimization problems with variable ordering structures are investigated in linear spaces. Firstly, the notion of weakly nondominated element of a set with a variable ordering structure is ...$\mathcal{}$

The concept of H-sets as introduced by Collatz in 1956 was very useful in univariate Chebyshev approximation by polynomials or Chebyshev spaces. In the multivariate setting, the situation is much worse, because there is no alternation, ...

In this paper, all of the conjectures in Aydin et al. (2022) [6] are settled: some proven correct, some proven correct with a modification, and some disproven, involving the equivalence and duality of polycyclic codes associated with ...

We study relation between two interpretations of the Tutte polynomial of a matroid perspective M 1 → M 2 on a set E given with a linear ordering <. A well known interpretation uses internal and external activities on a family B ( M 1 , ...