26 results on '"Hien Le"'
Search Results
2. Regular Coderivative and Graphical Derivative of the Metric Projection onto closed Balls in Hilbert spaces
- Author
-
Van Hien, Le
- Subjects
Mathematics - Functional Analysis - Abstract
In this paper, we first establish a formula for exactly computing the regular coderivative of the metric projection operator onto closed balls $r\mathbb{B}$ centered at the origin in Hilbert spaces. Then, this result is extended to metric projection operator onto any closed balls $\mathbb{B}(c,r)$, which has center $c$ in Hilbert space $H$ and with radius $r > 0$. Finally, we give the formula for calculating the graphical derivative of the metric projection operator onto closed balls with center at arbitrarily given point in Hilbert spaces.
- Published
- 2024
3. Some Results on the Strict Fr\'echet Differentiability of the Metric Projection Operator in Hilbert Spaces
- Author
-
Van Hien, Le
- Subjects
Mathematics - Functional Analysis - Abstract
In this paper, we first present a simpler proof of a result on the strict Fr\'echet differentiability of the metric projection operator onto closed balls centered at the origin in Hilbert spaces, which given by Li in \cite{Li24}. Then, based on this result, we prove the strict Fr\'echet differentiability of the metric projection operator onto closed balls with center at arbitrarily given point in Hilbert spaces. Finally, we study the strict Fr\'echet differentiability of the metric projection operator onto the second-order cones in Euclidean spaces.
- Published
- 2024
4. Block Majorization Minimization with Extrapolation and Application to $\beta$-NMF
- Author
-
Hien, Le Thi Khanh, Leplat, Valentin, and Gillis, Nicolas
- Subjects
Computer Science - Machine Learning ,Electrical Engineering and Systems Science - Signal Processing ,Mathematics - Numerical Analysis ,Mathematics - Optimization and Control - Abstract
We propose a Block Majorization Minimization method with Extrapolation (BMMe) for solving a class of multi-convex optimization problems. The extrapolation parameters of BMMe are updated using a novel adaptive update rule. By showing that block majorization minimization can be reformulated as a block mirror descent method, with the Bregman divergence adaptively updated at each iteration, we establish subsequential convergence for BMMe. We use this method to design efficient algorithms to tackle nonnegative matrix factorization problems with the $\beta$-divergences ($\beta$-NMF) for $\beta\in [1,2]$. These algorithms, which are multiplicative updates with extrapolation, benefit from our novel results that offer convergence guarantees. We also empirically illustrate the significant acceleration of BMMe for $\beta$-NMF through extensive experiments., Comment: 23 pages, code available from https://github.com/vleplat/BMMe
- Published
- 2024
5. Deep Nonnegative Matrix Factorization with Beta Divergences
- Author
-
Leplat, Valentin, Hien, Le Thi Khanh, Onwunta, Akwum, and Gillis, Nicolas
- Subjects
Computer Science - Machine Learning ,Electrical Engineering and Systems Science - Signal Processing ,Mathematics - Numerical Analysis ,Statistics - Machine Learning - Abstract
Deep Nonnegative Matrix Factorization (deep NMF) has recently emerged as a valuable technique for extracting multiple layers of features across different scales. However, all existing deep NMF models and algorithms have primarily centered their evaluation on the least squares error, which may not be the most appropriate metric for assessing the quality of approximations on diverse datasets. For instance, when dealing with data types such as audio signals and documents, it is widely acknowledged that $\beta$-divergences offer a more suitable alternative. In this paper, we develop new models and algorithms for deep NMF using some $\beta$-divergences, with a focus on the Kullback-Leibler divergence. Subsequently, we apply these techniques to the extraction of facial features, the identification of topics within document collections, and the identification of materials within hyperspectral images., Comment: 34 pages. We have improved the presentation of the paper, corrected a few typoes, and added the MU for beta=1/2. Accepted in Neural Computation
- Published
- 2023
6. Anomaly detection with semi-supervised classification based on risk estimators
- Author
-
Hien, Le Thi Khanh, Patra, Sukanya, and Taieb, Souhaib Ben
- Subjects
Computer Science - Machine Learning - Abstract
A significant limitation of one-class classification anomaly detection methods is their reliance on the assumption that unlabeled training data only contains normal instances. To overcome this impractical assumption, we propose two novel classification-based anomaly detection methods. Firstly, we introduce a semi-supervised shallow anomaly detection method based on an unbiased risk estimator. Secondly, we present a semi-supervised deep anomaly detection method utilizing a nonnegative (biased) risk estimator. We establish estimation error bounds and excess risk bounds for both risk minimizers. Additionally, we propose techniques to select appropriate regularization parameters that ensure the nonnegativity of the empirical risk in the shallow model under specific loss functions. Our extensive experiments provide strong evidence of the effectiveness of the risk-based anomaly detection methods.
- Published
- 2023
7. An inertial ADMM for a class of nonconvex composite optimization with nonlinear coupling constraints
- Author
-
Hien, Le Thi Khanh and Papadimitriou, Dimitri
- Subjects
Mathematics - Optimization and Control - Abstract
In this paper, we propose an inertial alternating direction method of multipliers for solving a class of non-convex multi-block optimization problems with \emph{nonlinear coupling constraints}. Distinctive features of our proposed method, when compared with other alternating direction methods of multipliers for solving non-convex problems with nonlinear coupling constraints, include: (i) we apply the inertial technique to the update of primal variables and (ii) we apply a non-standard update rule for the multiplier by scaling the multiplier by a factor before moving along the ascent direction where a relaxation parameter is allowed. Subsequential convergence and global convergence are presented for the proposed algorithm.
- Published
- 2022
8. Multiblock ADMM for nonsmooth nonconvex optimization with nonlinear coupling constraints
- Author
-
Hien, Le Thi Khanh and Papadimitriou, Dimitri
- Subjects
Mathematics - Optimization and Control ,Computer Science - Machine Learning - Abstract
This paper proposes a multiblock alternating direction method of multipliers for solving a class of multiblock nonsmooth nonconvex optimization problem with nonlinear coupling constraints. We employ a majorization minimization procedure in the update of each block of the primal variables. Subsequential and global convergence of the generated sequence to a critical point of the augmented Lagrangian are proved. We also establish iteration complexity and provide preliminary numerical results for the proposed algorithm.
- Published
- 2022
9. Block Alternating Bregman Majorization Minimization with Extrapolation
- Author
-
Hien, Le Thi Khanh, Phan, Duy Nhat, Gillis, Nicolas, Ahookhosh, Masoud, and Patrinos, Panagiotis
- Subjects
Mathematics - Optimization and Control ,Electrical Engineering and Systems Science - Signal Processing ,Mathematics - Numerical Analysis ,Statistics - Machine Learning - Abstract
In this paper, we consider a class of nonsmooth nonconvex optimization problems whose objective is the sum of a block relative smooth function and a proper and lower semicontinuous block separable function. Although the analysis of block proximal gradient (BPG) methods for the class of block $L$-smooth functions have been successfully extended to Bregman BPG methods that deal with the class of block relative smooth functions, accelerated Bregman BPG methods are scarce and challenging to design. Taking our inspiration from Nesterov-type acceleration and the majorization-minimization scheme, we propose a block alternating Bregman Majorization-Minimization framework with Extrapolation (BMME). We prove subsequential convergence of BMME to a first-order stationary point under mild assumptions, and study its global convergence under stronger conditions. We illustrate the effectiveness of BMME on the penalized orthogonal nonnegative matrix factorization problem.
- Published
- 2021
- Full Text
- View/download PDF
10. On the optical Stark effect of excitons in InGaAs prolate ellipsoidal quantum dots
- Author
-
Bao, Le Thi Ngoc, Phuoc, Duong Dinh, Hien, Le Thi Dieu, and Thao, Dinh Nhu
- Subjects
Condensed Matter - Mesoscale and Nanoscale Physics ,Physics - Optics - Abstract
In this paper, we study the exciton absorption spectra in InGaAs prolate ellipsoidal quantum dots when a strong pump laser resonant with electron quantized levels is active. Our obtained results by renormalized wavefunction theory show that, under suitable conditions, the initial exciton absorption peak is split into two new peaks as the evidence of the existence of the three-level optical Stark effect of excitons. We have suggested an explanation of the origin of the effect as well as investigating the effect of pump field energy, size, and geometric shape of the quantum dots on effect characteristics. The comparison with the results obtained in the spherical quantum dots implies the important role of geometric shape of the quantum structures when we examine this effect., Comment: 27pages, 12 figures,to be published in Journal of Nanomaterials
- Published
- 2021
11. A Framework of Inertial Alternating Direction Method of Multipliers for Non-Convex Non-Smooth Optimization
- Author
-
Hien, Le Thi Khanh, Phan, Duy Nhat, and Gillis, Nicolas
- Subjects
Mathematics - Optimization and Control ,Computer Science - Machine Learning ,Electrical Engineering and Systems Science - Signal Processing - Abstract
In this paper, we propose an algorithmic framework, dubbed inertial alternating direction methods of multipliers (iADMM), for solving a class of nonconvex nonsmooth multiblock composite optimization problems with linear constraints. Our framework employs the general minimization-majorization (MM) principle to update each block of variables so as to not only unify the convergence analysis of previous ADMM that use specific surrogate functions in the MM step, but also lead to new efficient ADMM schemes. To the best of our knowledge, in the nonconvex nonsmooth setting, ADMM used in combination with the MM principle to update each block of variables, and ADMM combined with \emph{inertial terms for the primal variables} have not been studied in the literature. Under standard assumptions, we prove the subsequential convergence and global convergence for the generated sequence of iterates. We illustrate the effectiveness of iADMM on a class of nonconvex low-rank representation problems., Comment: 35 pages, several parts of the paper clarified, additional experiments on a regularized NMF problem
- Published
- 2021
- Full Text
- View/download PDF
12. An Inertial Block Majorization Minimization Framework for Nonsmooth Nonconvex Optimization
- Author
-
Hien, Le Thi Khanh, Phan, Duy Nhat, and Gillis, Nicolas
- Subjects
Mathematics - Optimization and Control ,Computer Science - Machine Learning ,Electrical Engineering and Systems Science - Signal Processing - Abstract
In this paper, we introduce TITAN, a novel inerTIal block majorizaTion minimizAtioN framework for non-smooth non-convex optimization problems. To the best of our knowledge, TITAN is the first framework of block-coordinate update method that relies on the majorization-minimization framework while embedding inertial force to each step of the block updates. The inertial force is obtained via an extrapolation operator that subsumes heavy-ball and Nesterov-type accelerations for block proximal gradient methods as special cases. By choosing various surrogate functions, such as proximal, Lipschitz gradient, Bregman, quadratic, and composite surrogate functions, and by varying the extrapolation operator, TITAN produces a rich set of inertial block-coordinate update methods. We study sub-sequential convergence as well as global convergence for the generated sequence of TITAN. We illustrate the effectiveness of TITAN on two important machine learning problems, namely sparse non-negative matrix factorization and matrix completion., Comment: 42 pages, we have clarified several aspects of the paper
- Published
- 2020
13. Algorithms for Nonnegative Matrix Factorization with the Kullback-Leibler Divergence
- Author
-
Hien, Le Thi Khanh and Gillis, Nicolas
- Subjects
Mathematics - Optimization and Control ,Computer Science - Machine Learning ,Electrical Engineering and Systems Science - Signal Processing ,Statistics - Machine Learning - Abstract
Nonnegative matrix factorization (NMF) is a standard linear dimensionality reduction technique for nonnegative data sets. In order to measure the discrepancy between the input data and the low-rank approximation, the Kullback-Leibler (KL) divergence is one of the most widely used objective function for NMF. It corresponds to the maximum likehood estimator when the underlying statistics of the observed data sample follows a Poisson distribution, and KL NMF is particularly meaningful for count data sets, such as documents or images. In this paper, we first collect important properties of the KL objective function that are essential to study the convergence of KL NMF algorithms. Second, together with reviewing existing algorithms for solving KL NMF, we propose three new algorithms that guarantee the non-increasingness of the objective function. We also provide a global convergence guarantee for one of our proposed algorithms. Finally, we conduct extensive numerical experiments to provide a comprehensive picture of the performances of the KL NMF algorithms., Comment: 31 pages, Accepted in the Journal of Scientific Computing
- Published
- 2020
- Full Text
- View/download PDF
14. A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorization
- Author
-
Ahookhosh, Masoud, Hien, Le Thi Khanh, Gillis, Nicolas, and Patrinos, Panagiotis
- Subjects
Mathematics - Optimization and Control ,Mathematics - Numerical Analysis - Abstract
We propose BIBPA, a block inertial Bregman proximal algorithm for minimizing the sum of a block relatively smooth function (that is, relatively smooth concerning each block) and block separable nonsmooth nonconvex functions. We prove that the sequence generated by BIBPA subsequentially converges to critical points of the objective under standard assumptions, and globally converges when the objective function is additionally assumed to satisfy the Kurdyka-{\L}ojasiewicz (K{\L}) property. We also provide the convergence rate when the objective satisfies the {\L}ojasiewicz inequality. We apply BIBPA to the symmetric nonnegative matrix tri-factorization (SymTriNMF) problem, where we propose kernel functions for SymTriNMF and provide closed-form solutions for subproblems of BIBPA., Comment: 18 pages
- Published
- 2020
15. Accelerating Block Coordinate Descent for Nonnegative Tensor Factorization
- Author
-
Ang, Andersen Man Shun, Cohen, Jeremy E., Gillis, Nicolas, and Hien, Le Thi Khanh
- Subjects
Mathematics - Numerical Analysis ,Computer Science - Machine Learning ,Mathematics - Optimization and Control ,Statistics - Machine Learning - Abstract
This paper is concerned with improving the empirical convergence speed of block-coordinate descent algorithms for approximate nonnegative tensor factorization (NTF). We propose an extrapolation strategy in-between block updates, referred to as heuristic extrapolation with restarts (HER). HER significantly accelerates the empirical convergence speed of most existing block-coordinate algorithms for dense NTF, in particular for challenging computational scenarios, while requiring a negligible additional computational budget., Comment: 32 pages, 24 figures
- Published
- 2020
- Full Text
- View/download PDF
16. Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization
- Author
-
Ahookhosh, Masoud, Hien, Le Thi Khanh, Gillis, Nicolas, and Patrinos, Panagiotis
- Subjects
Mathematics - Optimization and Control ,Mathematics - Numerical Analysis - Abstract
We introduce and analyze BPALM and A-BPALM, two multi-block proximal alternating linearized minimization algorithms using Bregman distances for solving structured nonconvex problems. The objective function is the sum of a multi-block relatively smooth function (i.e., relatively smooth by fixing all the blocks except one) and block separable (nonsmooth) nonconvex functions. It turns out that the sequences generated by our algorithms are subsequentially convergent to critical points of the objective function, while they are globally convergent under KL inequality assumption. Further, the rate of convergence is further analyzed for functions satisfying the {\L}ojasiewicz's gradient inequality. We apply this framework to orthogonal nonnegative matrix factorization (ONMF) that satisfies all of our assumptions and the related subproblems are solved in closed forms, where some preliminary numerical results is reported.
- Published
- 2019
- Full Text
- View/download PDF
17. Second order optimality conditions for strong local minimizers via subgradient graphical derivative
- Author
-
Chieu, Nguyen Huy, Van Hien, Le, Nghia, Tran T. A., and Tuan, Ha Anh
- Subjects
Mathematics - Optimization and Control ,49J53, 90C31, 90C46 - Abstract
This paper is devoted to the study of second order optimality conditions for strong local minimizers in the frameworks of unconstrained and constrained optimization problems in finite dimensions via subgradient graphical derivative. We prove that the positive definiteness of the subgradient graphical derivative of an extended-real-valued lower semicontinuous proper function at a proximal stationary point is sufficient for the quadratic growth condition. It is also a necessary condition for the latter property when the function is either subdifferentially continuous, prox-regular, twice epi-differentiable or variationally convex. By applying our results to the $\mathcal{C}^2$-cone reducible constrained programs, we establish no-gap second order optimality conditions for (strong) local minimizers under the metric subregularity constraint qualification. These results extend the classical second order optimality conditions by surpassing the well-known Robinson's constraint qualification. Our approach also highlights the interconnection between the strong metric subregularity of subdifferential and quadratic growth condition in optimization problems., Comment: 25 pages, 2 figures
- Published
- 2019
18. Inertial Block Proximal Methods for Non-Convex Non-Smooth Optimization
- Author
-
Hien, Le Thi Khanh, Gillis, Nicolas, and Patrinos, Panagiotis
- Subjects
Mathematics - Optimization and Control ,Mathematics - Numerical Analysis ,Statistics - Machine Learning - Abstract
We propose inertial versions of block coordinate descent methods for solving non-convex non-smooth composite optimization problems. Our methods possess three main advantages compared to current state-of-the-art accelerated first-order methods: (1) they allow using two different extrapolation points to evaluate the gradients and to add the inertial force (we will empirically show that it is more efficient than using a single extrapolation point), (2) they allow to randomly picking the block of variables to update, and (3) they do not require a restarting step. We prove the subsequential convergence of the generated sequence under mild assumptions, prove the global convergence under some additional assumptions, and provide convergence rates. We deploy the proposed methods to solve non-negative matrix factorization (NMF) and show that they compete favorably with the state-of-the-art NMF algorithms. Additional experiments on non-negative approximate canonical polyadic decomposition, also known as non-negative tensor factorization, are also provided.
- Published
- 2019
19. Distributionally Robust and Multi-Objective Nonnegative Matrix Factorization
- Author
-
Gillis, Nicolas, Hien, Le Thi Khanh, Leplat, Valentin, and Tan, Vincent Y. F.
- Subjects
Computer Science - Machine Learning ,Mathematics - Optimization and Control ,Statistics - Machine Learning - Abstract
Nonnegative matrix factorization (NMF) is a linear dimensionality reduction technique for analyzing nonnegative data. A key aspect of NMF is the choice of the objective function that depends on the noise model (or statistics of the noise) assumed on the data. In many applications, the noise model is unknown and difficult to estimate. In this paper, we define a multi-objective NMF (MO-NMF) problem, where several objectives are combined within the same NMF model. We propose to use Lagrange duality to judiciously optimize for a set of weights to be used within the framework of the weighted-sum approach, that is, we minimize a single objective function which is a weighted sum of the all objective functions. We design a simple algorithm based on multiplicative updates to minimize this weighted sum. We show how this can be used to find distributionally robust NMF (DR-NMF) solutions, that is, solutions that minimize the largest error among all objectives, using a dual approach solved via a heuristic inspired from the Frank-Wolfe algorithm. We illustrate the effectiveness of this approach on synthetic, document and audio data sets. The results show that DR-NMF is robust to our incognizance of the noise model of the NMF problem., Comment: Accepted in IEEE Trans. on Pattern Analysis and Machine Intelligence
- Published
- 2019
20. A global linear and local superlinear/quadratic inexact non-interior continuation method for variational inequalities
- Author
-
Hien, Le Thi Khanh and Chua, Chek Beng
- Subjects
Mathematics - Optimization and Control - Abstract
We use the concept of barrier-based smoothing approximations introduced in [ C. B. Chua and Z. Li, A barrier-based smoothing proximal point algorithm for NCPs over closed convex cones, SIOPT 23(2), 2010] to extend the non-interior continuation method proposed in [B. Chen and N. Xiu, A global linear and local quadratic noninterior continuation method for nonlinear complementarity problems based on Chen-Mangasarian smoothing functions, SIOPT 9(3), 1999] to an inexact non-interior continuation method for variational inequalities over general closed convex sets. Newton equations involved in the method are solved inexactly to deal with high dimension problems. The method is proved to have global linear and local superlinear/quadratic convergence under suitable assumptions. We apply the method to non-negative orthants, positive semidefinite cones, polyhedral sets, epigraphs of matrix operator norm cone and epigraphs of matrix nuclear norm cone.
- Published
- 2018
21. An Inexact Primal-Dual Smoothing Framework for Large-Scale Non-Bilinear Saddle Point Problems
- Author
-
Hien, Le Thi Khanh, Zhao, Renbo, and Haskell, William B.
- Subjects
Mathematics - Optimization and Control - Abstract
We develop an inexact primal-dual first-order smoothing framework to solve a class of non-bilinear saddle point problems with primal strong convexity. Compared with existing methods, our framework yields a significant improvement over the primal oracle complexity, while it has competitive dual oracle complexity. In addition, we consider the situation where the primal-dual coupling term has a large number of component functions. To efficiently handle this situation, we develop a randomized version of our smoothing framework, which allows the primal and dual sub-problems in each iteration to be inexactly solved by randomized algorithms in expectation. The convergence of this framework is analyzed both in expectation and with high probability. In terms of the primal and dual oracle complexities, this framework significantly improves over its deterministic counterpart. As an important application, we adapt both frameworks for solving convex optimization problems with many functional constraints. To obtain an $\varepsilon$-optimal and $\varepsilon$-feasible solution, both frameworks achieve the best-known oracle complexities.
- Published
- 2017
22. Characterization of tilt stability via subgradient graphical derivative with applications to nonlinear programming
- Author
-
Chieu, Nguyen Huy, Van Hien, Le, and Nghia, Tran T. A.
- Subjects
Mathematics - Optimization and Control ,49J53, 90C31, 90C46 - Abstract
This paper is devoted to the study of tilt stability in finite dimensional optimization via the approach of using the subgradient graphical derivative. We establish a new characterization of tilt-stable local minimizers for a broad class of unconstrained optimization problems in terms of a uniform positive definiteness of the subgradient graphical derivative of the objective function around the point in question. By applying this result to nonlinear programming under the metric subregularity constraint qualification, we derive a second-order characterization and several new sufficient conditions for tilt stability. In particular, we show that each stationary point of a nonlinear programming problem satisfying the metric subregularity constraint qualification is a tilt-stable local minimizer if the classical strong second-order sufficient condition holds.
- Published
- 2017
23. Accelerated Randomized Mirror Descent Algorithms For Composite Non-strongly Convex Optimization
- Author
-
Hien, Le Thi Khanh, Nguyen, Cuong V., Xu, Huan, Lu, Canyi, and Feng, Jiashi
- Subjects
Mathematics - Optimization and Control ,Statistics - Machine Learning ,65K05, 90C06, 90C30 - Abstract
We consider the problem of minimizing the sum of an average function of a large number of smooth convex components and a general, possibly non-differentiable, convex function. Although many methods have been proposed to solve this problem with the assumption that the sum is strongly convex, few methods support the non-strongly convex case. Adding a small quadratic regularization is a common devise used to tackle non-strongly convex problems; however, it may cause loss of sparsity of solutions or weaken the performance of the algorithms. Avoiding this devise, we propose an accelerated randomized mirror descent method for solving this problem without the strongly convex assumption. Our method extends the deterministic accelerated proximal gradient methods of Paul Tseng and can be applied even when proximal points are computed inexactly. We also propose a scheme for solving the problem when the component functions are non-smooth.
- Published
- 2016
24. New summation inequalities and their applications to discrete-time delay systems
- Author
-
Van Hien, Le and Trinh, Hieu
- Subjects
Mathematics - Optimization and Control ,34D05, 34K20, 93D05, 93D20 - Abstract
This paper provides new summation inequalities in both single and double forms to be used in stability analysis of discrete-time systems with time-varying delays. The potential capability of the newly derived inequalities is demonstrated by establishing less conservative stability conditions for a class of linear discrete-time systems with an interval time-varying delay in the framework of linear matrix inequalities. The effectiveness and least conservativeness of the derived stability conditions are shown by academic and practical examples., Comment: 15 pages, 01 figure
- Published
- 2015
- Full Text
- View/download PDF
25. On the existence and exponential attractivity of a unique positive almost periodic solution to an impulsive hematopoiesis model with delays
- Author
-
Anh, Trinh Tuan, Van Nhung, Tran, and Van Hien, Le
- Subjects
Mathematics - Classical Analysis and ODEs - Abstract
In this paper, a generalized model of hematopoiesis with delays and impulses is considered. By employing the contraction mapping principle and a novel type of impulsive delay inequality, we prove the existence of a unique positive almost periodic solution of the model. It is also proved that, under the proposed conditions in this paper, the unique positive almost periodic solution is globally exponentially attractive. A numerical example is given to illustrate the effectiveness of the obtained results., Comment: Accepted for publication in AMV
- Published
- 2015
- Full Text
- View/download PDF
26. Stability of Solutions of Fuzzy Differential Equations
- Author
-
Van Hien, Le
- Subjects
Mathematics - Dynamical Systems ,Mathematics - Classical Analysis and ODEs ,34D20, 34G20 - Abstract
In this paper, We study the stability of solutions of fuzzy differential equations by Lyapunov's second method. By using scale equations and comparison principle for Lyapunov - like functions, we give some sufficient criterias for the stability and asymptotic stability of solutions of fuzzy differential equations., Comment: 10 pages, 5 Theorems, interesting result in Exponential Stability
- Published
- 2004
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.