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