A new steepest descent differential inclusion-based method for solving general nonsmooth convex optimization problems
From MaRDI portal
Publication:2442700
DOI10.1007/s10957-012-0258-4zbMath1311.90101OpenAlexW1991261176MaRDI QIDQ2442700
Alireza Hosseini, Mohammed Hosseini Ali Abadi
Publication date: 1 April 2014
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-012-0258-4
convergence of trajectoriesdifferential inclusion-based methodsgeneral nonsmooth convex optimizationsteepest descent neural network
Related Items (7)
A non-penalty recurrent neural network for solving a class of constrained optimization problems ⋮ A nonpenalty neurodynamic model for complex-variable optimization ⋮ Radial basis function neural network (RBFNN) approximation of Cauchy inverse problems of the Laplace equation ⋮ A novel growing wavelet neural network algorithm for solving chemotaxis systems with blow‐up ⋮ A globally convergent neurodynamics optimization model for mathematical programming with equilibrium constraints ⋮ A recurrent neural network for solving a class of generalized convex optimization problems ⋮ A neurodynamic optimization approach for complex-variables programming problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On approximations with finite precision in bundle methods for nonsmooth optimization
- New bundle methods for solving Lagrangian relaxation dual problems
- Essentially smooth Lipschitz functions
- A feasible semismooth asymptotically Newton method for mixed complementarity problems
- New variants of bundle methods
- Methods of descent for nondifferentiable optimization
- Subgradient-based feedback neural networks for non-differentiable convex optimization problems
- A differential inclusion-based approach for solving nonsmooth convex optimization problems
- Nonsmooth Optimization Using Mordukhovich's Subdifferential
- The Cutting-Plane Method for Solving Convex Programs
- Optimization and nonsmooth analysis
- Decomposition and Nondifferentiable Optimization with the Projective Algorithm
- Semismooth and Semiconvex Functions in Constrained Optimization
- Generalized Neural Network for Nonsmooth Nonlinear Programming Problems
- Survey of Bundle Methods for Nonsmooth Optimization
- Generalized gradient projection neural networks for nonsmooth optimization problems
This page was built for publication: A new steepest descent differential inclusion-based method for solving general nonsmooth convex optimization problems
