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

DOI10.1080/10556788.2012.696262MaRDI QIDQ2867435zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

non-smooth optimizationbackpropagation methodsRPROP

Mathematics Subject Classification ID

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

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

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

Cited in

(1)

• Nonlinear optimisation using directional step lengths based on RPROP

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)