Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2503.05874

On the resolution and linear optimization problems subject to a system of bipolar fuzzy relational equalities defined with continuous Archimedean t-norms

Amin Ghodousian·Mohammad Sedigh Chopannavaz·Witold Pedrycz
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper considers the linear objective function optimization with respect to a more general class of bipolar fuzzy relational equations, where the fuzzy compositions are defined by an arbitrary continuous Archimedean t-norm. In addition, a faster method for finding a global optimum is proposed. Analytical concepts and properties of the Archimedean bipolar fuzzy equations are investigated and two necessary conditions are presented to conceptualize the feasibility of the problem. It is shown that the feasible solution set can be resulted by a union of the finite number of compact sets, where each compact set is obtained by a function (called admissible function in this paper). Moreover, to accelerate identification of the mentioned compact sets (and therefore, to speed up solution finding), four simplification techniques are presented, which are based on either omitting redundant constraints and/or eliminating unknowns by assigning them a fixed value. Also, three additional simplification techniques are given to reduce the search domain by removing some parts of the feasible region that do not contain optimal solutions. Subsequently, a method is proposed to find an optimal solution for the current linear optimization problems. The proposed method consists of two accelerative strategies that are used during the problem solving process. By the first strategy, the method neglects some candidate solutions that are not optimal, by considering only a subset of admissible functions (called modified functions in this paper). As for the second strategy, a branch-and-bound method is used to delete non-optimal branches. Then, the method is summarized in an algorithm that represents all essential steps of the solution and finally, the whole method is applied in an example that has been chosen in such a way that the various situations are illustrated.

Explore related subjects

math.OC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Amin Ghodousian, Mohammad Sedigh Chopannavaz, Witold Pedrycz. 2025-08-29. On the resolution and linear optimization problems subject to a system of bipolar fuzzy relational equalities defined with continuous Archimedean t-norms. https://doi.org/10.22111/ijfs.2025.50906.8994

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Strategic Inference in Stackelberg Games: Optimal Control for Revealing Adversary Intent

We study a continuous-time stochastic Stackelberg game in which a leader seeks to accomplish a primary objective while inferring a hidden parameter of a rational follower. The follower solves an entropy-regularized linear-quadratic tracking problem and responds to the leader's trajectory with a randomized policy. Anticipating this response, the leader designs informative controls to maximize the estimation efficiency for the follower's latent intent, through maximum likelihood estimation. Unlike prior work on discrete-time or finite-candidate inverse learning, our framework enables continuous parameter inference without prior assumptions and endogenizes the information source through the follower's strategic feedback. We derive semi-explicit solutions, prove well-posedness, and develop recurrent neural network algorithms to approximate the leader's path-dependent control. Numerical experiments demonstrate how the leader balances task performance and information gain, highlighting the practical value of our approach for adversarial strategic inference.

math.OC↗
arXiv2026

Stratification for Nonlinear Semidefinite Programming

This paper introduces a stratification framework for nonlinear semidefinite programming (NLSDP) that reveals and utilizes the geometry behind the nonsmooth KKT system. Based on the index stratification of $\mathbb{S}^n$ and its lift to the primal-dual space, a stratified variational analysis is developed. Specifically, we define the stratum-restricted regularity property, characterize it by the verifiable weak second order condition (W-SOC) and weak strict Robinson constraint qualification (W-SRCQ), and interpret the W-SRCQ geometrically via transversality, with stability along strata. The interactions of these properties across neighboring strata are further examined, leading to the conclusion that classical strong-form regularity conditions correspond to the local uniform validity of stratum-restricted counterparts. On the algorithmic side, a stratified Gauss--Newton method with normal steps and a correction mechanism is proposed for globally solving the KKT equation through a least-squares merit function. We demonstrate that the algorithm converges globally to directional stationary points. Moreover, under the second order sufficient condition (SOSC) and the strict Robinson constraint qualification (SRCQ) at an accumulation point, with a suitable correction threshold, the whole sequence converges superlinearly to this point, which is a KKT pair, and eventually identifies the active stratum. The rate is quadratic if the problem data are additionally of class $LC^2$ near the solution.

math.OC↗
arXiv2026

Convergence Rate Analysis of SOAP with Arbitrary Orthogonal Projection Matrices

In this short note, we establish, for the first time, the convergence rate of SOAP, an efficient and popular matrix-based optimizer for training deep neural networks. Our analysis extends to a more general variant of SOAP that admits arbitrary orthogonal projection matrices and requires only that these matrices be conditionally independent of the current stochastic gradient at each iteration. For example, they may be constructed from information available up to the preceding step.

math.OC↗