The solution set of fuzzy relation equations with addition-min
composition
- URL: http://arxiv.org/abs/2210.16502v1
- Date: Sat, 29 Oct 2022 05:39:04 GMT
- Title: The solution set of fuzzy relation equations with addition-min
composition
- Authors: Meng Li, Xue-Ping Wang
- Abstract summary: This paper deals with the resolutions of fuzzy relation equations with addition-min composition.
We first propose an algorithm to find all minimal solutions of the fuzzy relation equations and also supply an algorithm to find all maximal solutions of the fuzzy relation equations.
- Score: 5.327411221630033
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: This paper deals with the resolutions of fuzzy relation equations with
addition-min composition. When the fuzzy relation equations have a solution, we
first propose an algorithm to find all minimal solutions of the fuzzy relation
equations and also supply an algorithm to find all maximal solutions of the
fuzzy relation equations, which will be illustrated, respectively, by numeral
examples. Then we prove that every solution of the fuzzy relation equations is
between a minimal solution and a maximal one, so that we describe the solution
set of the fuzzy relation equations completely.
Related papers
- Reducing fuzzy relation equations via concept lattices [0.5735035463793009]
This paper introduces a procedure to reduce a Fuzzy Relation Equations (FRE) without losing information.
attribute reduction theory in property-oriented and object-oriented concept lattices has been considered in order to present a mechanism for detecting redundant equations.
We will also introduce a novel method for computing approximate solutions of unsolvable FRE related to a (real) dataset with uncertainty/imprecision data.
arXiv Detail & Related papers (2024-10-08T06:47:35Z) - Bipolar fuzzy relation equations systems based on the product t-norm [0.5735035463793009]
Bipolar fuzzy relation equations arise as a generalization of fuzzy relation equations considering unknown variables together with their logical connective negations.
This paper focuses on the study of bipolar fuzzy relation equations systems based on the max-product t-norm composition.
arXiv Detail & Related papers (2024-09-24T09:09:13Z) - Comparison of Single- and Multi- Objective Optimization Quality for
Evolutionary Equation Discovery [77.34726150561087]
Evolutionary differential equation discovery proved to be a tool to obtain equations with less a priori assumptions.
The proposed comparison approach is shown on classical model examples -- Burgers equation, wave equation, and Korteweg - de Vries equation.
arXiv Detail & Related papers (2023-06-29T15:37:19Z) - Linearization Algorithms for Fully Composite Optimization [61.20539085730636]
This paper studies first-order algorithms for solving fully composite optimization problems convex compact sets.
We leverage the structure of the objective by handling differentiable and non-differentiable separately, linearizing only the smooth parts.
arXiv Detail & Related papers (2023-02-24T18:41:48Z) - Approximation of optimization problems with constraints through kernel
Sum-Of-Squares [77.27820145069515]
We show that pointwise inequalities are turned into equalities within a class of nonnegative kSoS functions.
We also show that focusing on pointwise equality constraints enables the use of scattering inequalities to mitigate the curse of dimensionality in sampling the constraints.
arXiv Detail & Related papers (2023-01-16T10:30:04Z) - Convex mixed-integer optimization with Frank-Wolfe methods [20.37026309402396]
Mixed-integer nonlinear optimization presents both theoretical and computational challenges.
We propose a new type of method to solve these problems based on a branch-and-bound algorithm with convex node relaxations.
arXiv Detail & Related papers (2022-08-23T14:46:54Z) - On the solvability of weakly linear systems of fuzzy relation equations [0.0]
Systems of fuzzy relation equations and inequalities in which an unknown fuzzy relation is on the one side of the equation or inequality are linear systems.
This paper describes the set of fuzzy relations that solve weakly linear systems to a certain degree and provides ways to compute them.
arXiv Detail & Related papers (2022-05-25T16:59:48Z) - Learning Proximal Operators to Discover Multiple Optima [66.98045013486794]
We present an end-to-end method to learn the proximal operator across non-family problems.
We show that for weakly-ized objectives and under mild conditions, the method converges globally.
arXiv Detail & Related papers (2022-01-28T05:53:28Z) - On the Complexity of a Practical Primal-Dual Coordinate Method [63.899427212054995]
We prove complexity bounds for primal-dual algorithm with random and coordinate descent (PURE-CD)
It has been shown to obtain good extrapolation for solving bi-max performance problems.
arXiv Detail & Related papers (2022-01-19T16:14:27Z) - Sparse Approximate Solutions to Max-Plus Equations with Application to
Multivariate Convex Regression [34.99564569478268]
We show how one can obtain such solutions efficiently and in minimum time for any $ell_p$ approximation error.
We propose a novel method for piecewise fitting of convex functions, with optimality guarantees and an approximately sparse affine regions.
arXiv Detail & Related papers (2020-11-06T15:17:00Z) - Conditional gradient methods for stochastically constrained convex
minimization [54.53786593679331]
We propose two novel conditional gradient-based methods for solving structured convex optimization problems.
The most important feature of our framework is that only a subset of the constraints is processed at each iteration.
Our algorithms rely on variance reduction and smoothing used in conjunction with conditional gradient steps, and are accompanied by rigorous convergence guarantees.
arXiv Detail & Related papers (2020-07-07T21:26:35Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.