Non-smooth optimization based on resilient backpropagation search for unconstrained and simply bounded problems
From MaRDI portal
Publication:2867435
DOI10.1080/10556788.2012.696262zbMATH Open1278.90255OpenAlexW2014440439MaRDI QIDQ2867435FDOQ2867435
Authors: Apostolos Kotsialos 
Publication date: 19 December 2013
Published in: Optimization Methods \& Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2012.696262
Recommendations
- A non-penalty recurrent neural network for solving a class of constrained optimization problems
- A smooth method for solving non-smooth unconstrained optimization problems
- Substantiation of the backpropagation technique via the Hamilton-Pontryagin formalism for training nonconvex nonsmooth neural networks
- A direct search method for smooth and nonsmooth unconstrained optimization
- Neural network for nonsmooth pseudoconvex optimization with general convex constraints
- Beyond Backpropagation: Bilevel Optimization Through Implicit Differentiation and Equilibrium Propagation
- A Recurrent Neural Network for Nonlinear Convex Optimization Subject to Nonlinear Inequality Constraints
- An acceleration of gradient descent algorithm with backtracking for unconstrained opti\-mi\-za\-tion
- A residual-based algorithm for solving a class of structured nonsmooth optimization problems
Cites Work
- An implementation of Shor's \(r\)-algorithm
- New limited memory bundle method for large-scale nonsmooth optimization
- Title not available (Why is that?)
- A Simplex Method for Function Minimization
- Title not available (Why is that?)
- Methods of descent for nondifferentiable optimization
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization
- Globally convergent variable metric method for convex nonsmooth unconstrained minimization
- The Cutting-Plane Method for Solving Convex Programs
- Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization
- Newton's method for convex programming and Tschebyscheff approximation
- Empirical evaluation of the improved rprop learning algorithms
- Diagonal bundle method for nonsmooth sparse optimization
- Piecewise partially separable functions and a derivative-free algorithm for large scale nonsmooth optimization
Cited In (1)
This page was built for publication: Non-smooth optimization based on resilient backpropagation search for unconstrained and simply bounded problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867435)
