DGM

swMATH6159MaRDI QIDQ18293FDOQ18293

Author name not available (Why is that?)

Described by source

• Discrete gradient method: Derivative-free method for nonsmooth optimization

Cited In (46)

• Solving dual problems using a coevolutionary optimization algorithm
• A discussion on variational analysis in derivative-free optimization
• Codifferential method for minimizing nonsmooth DC functions
• Aggregate subgradient method for nonsmooth DC optimization
• An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization
• An algorithm for the estimation of a regression function by continuous piecewise linear functions
• Improved convergence result for the discrete gradient and secant methods for nonsmooth optimization
• Numerical infinitesimals in a variable metric method for convex nonsmooth optimization
• A difference of convex optimization algorithm for piecewise linear regression
• Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization
• Essentials of numerical nonsmooth optimization
• Nonsmooth multiobjective problems and generalized vector variational inequalities using quasi-efficiency
• Introduction to Nonsmooth Optimization
• An incremental nonsmooth optimization algorithm for clustering using \(L_1\) and \(L_\infty\) norms
• A convergence analysis of the method of codifferential descent
• Full-low evaluation methods for derivative-free optimization
• Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions
• A proximal bundle method for nonsmooth nonconvex functions with inexact information
• Separation of convex sets by Clarke subdifferential
• A derivative-free approximate gradient sampling algorithm for finite minimax problems
• Computing proximal points of convex functions with inexact subgradients
• Algorithmic construction of the subdifferential from directional derivatives
• A Nonsmooth Trust-Region Method for Locally Lipschitz Functions with Application to Optimization Problems Constrained by Variational Inequalities
• Two structure-preserving time discretizations for gradient flows
• An effective nonsmooth optimization algorithm for locally Lipschitz functions
• An incremental piecewise linear classifier based on polyhedral conic separation
• Aggregate codifferential method for nonsmooth DC optimization
• Subgradient and Bundle Methods for Nonsmooth Optimization
• Comparing different nonsmooth minimization methods and software
• Trust-Region Methods for the Derivative-Free Optimization of Nonsmooth Black-Box Functions
• Subgradient method for nonconvex nonsmooth optimization
• Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms
• A quasisecant method for minimizing nonsmooth functions
• Nonsmooth optimization algorithm for solving clusterwise linear regression problems
• Gradient set splitting in nonconvex nonsmooth numerical optimization
• Manifold Sampling for Optimization of Nonconvex Functions That Are Piecewise Linear Compositions of Smooth Components
• Weak subgradient method for solving nonsmooth nonconvex optimization problems
• Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization
• A geometric integration approach to nonsmooth, nonconvex optimisation
• A derivative-free 𝒱𝒰-algorithm for convex finite-max problems
• A novel piecewise linear classifier based on polyhedral conic and max-min separabilities
• A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems
• Derivative-free optimization methods
• A simple version of bundle method with linear programming
• A quasisecant method for solving a system of nonsmooth equations
• Essentials of numerical nonsmooth optimization

This page was built for software: DGM