Training morphological perceptron with competitive layer using convex-concave procedure
From MaRDI portal
Cites work
- DC programming and DCA: thirty years of developments
- DC programming: overview.
- Decomposition of mappings between complete lattices by mathematical morphology. I: General lattices
- scientific article; zbMATH DE number 6381735 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 914826 (Why is no real title available?)
- scientific article; zbMATH DE number 3231758 (Why is no real title available?)
- scientific article; zbMATH DE number 3314813 (Why is no real title available?)
- Introduction to Lattice Algebra
- Introduction to nonlinear optimization: theory, algorithms, and applications with MATLAB
- Learnable Empirical Mode Decomposition based on Mathematical Morphology
- Lectures on convex optimization
- Minimax algebra
- Morphological perceptrons with competitive learning: lattice-theoretical framework and constructive learning algorithm
- Morphological Perceptrons: Geometry and Training Algorithms
- Morphology neural networks: An introduction with applications
- On functions representable as a difference of convex functions
- The Concave-Convex Procedure
- Variations and extension of the convex-concave procedure
This page was built for publication: Training morphological perceptron with competitive layer using convex-concave procedure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7312061)