Non-smooth optimization based on resilient backpropagation search for unconstrained and simply bounded problems

DOI10.1080/10556788.2012.696262zbMath1278.90255OpenAlexW2014440439MaRDI QIDQ2867435

Apostolos Kotsialos

Publication date: 19 December 2013

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2012.696262

zbMATH Keywords

non-smooth optimizationbackpropagation methodsRPROP

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)

Related Items (1)

Nonlinear optimisation using directional step lengths based on RPROP

Cites Work

• Unnamed Item
• Unnamed Item
• Diagonal bundle method for nonsmooth sparse optimization
• Globally convergent limited memory bundle method for large-scale nonsmooth optimization
• Newton's method for convex programming and Tschebyscheff approximation
• An implementation of Shor's \(r\)-algorithm
• Globally convergent variable metric method for convex nonsmooth unconstrained minimization
• Empirical evaluation of the improved rprop learning algorithms
• Methods of descent for nondifferentiable optimization
• Piecewise partially separable functions and a derivative-free algorithm for large scale nonsmooth optimization
• The Cutting-Plane Method for Solving Convex Programs
• A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
• New limited memory bundle method for large-scale nonsmooth optimization
• A Simplex Method for Function Minimization
• Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization

This page was built for publication: Non-smooth optimization based on resilient backpropagation search for unconstrained and simply bounded problems