Discrete gradient method: Derivative-free method for nonsmooth optimization
From MaRDI portal
Recommendations
- A derivative-free method for linearly constrained nonsmooth optimization
- Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization
- Diagonal discrete gradient bundle method for derivative free nonsmooth optimization
- Improved convergence result for the discrete gradient and secant methods for nonsmooth optimization
- An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization
Cites work
- scientific article; zbMATH DE number 3559294 (Why is no real title available?)
- scientific article; zbMATH DE number 3577030 (Why is no real title available?)
- scientific article; zbMATH DE number 872150 (Why is no real title available?)
- scientific article; zbMATH DE number 1421092 (Why is no real title available?)
- A Dual Method for Certain Positive Semidefinite Quadratic Programming Problems
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- A bundle type approach to the unconstrained minimization of convex nonsmooth functions
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
- Algorithms for finite and semi-infinite Min-Max-Min problems using adaptive smoothing techniques
- An Algorithm for Constrained Optimization with Semismooth Functions
- Analysis of Generalized Pattern Searches
- Continuous subdifferential approximations and their applications
- Finding the nearest point in A polytope
- Generalized Bundle Methods
- Methods of descent for nondifferentiable optimization
- On the Convergence of Pattern Search Algorithms
- Optimization and nonsmooth analysis
- Semismooth and Semiconvex Functions in Constrained Optimization
- Solving semidefinite quadratic problems within nonsmooth optimization algorithms
- Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder)
Cited in
(60)- Nonsmooth optimization algorithm for solving clusterwise linear regression problems
- Manifold sampling for optimizing nonsmooth nonconvex compositions
- Numerical infinitesimals in a variable metric method for convex nonsmooth optimization
- A derivative-free approximate gradient sampling algorithm for finite minimax problems
- Comparing different nonsmooth minimization methods and software
- Solving dual problems using a coevolutionary optimization algorithm
- Two structure-preserving time discretizations for gradient flows
- Nonsmooth multiobjective problems and generalized vector variational inequalities using quasi-efficiency
- An effective nonsmooth optimization algorithm for locally Lipschitz functions
- A difference of convex optimization algorithm for piecewise linear regression
- A discussion on variational analysis in derivative-free optimization
- An incremental piecewise linear classifier based on polyhedral conic separation
- Manifold sampling for optimization of nonconvex functions that are piecewise linear compositions of smooth components
- Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization
- Derivative-free optimization methods
- Trust-region methods for the derivative-free optimization of nonsmooth black-box functions
- A direct search quasi-Newton method for nonsmooth unconstrained optimization
- Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization
- A geometric integration approach to nonsmooth, nonconvex optimisation
- Computing proximal points of convex functions with inexact subgradients
- Diagonal discrete gradient bundle method for derivative free nonsmooth optimization
- Testing different nonsmooth formulations of the Lennard-Jones potential in atomic clustering problems
- An incremental nonsmooth optimization algorithm for clustering using \(L_1\) and \(L_\infty\) norms
- A derivative-free \(\mathcal{V} \mathcal{U}\)-algorithm for convex finite-max problems
- Hyperbolic smoothing function method for minimax problems
- A simple version of bundle method with linear programming
- Aggregate codifferential method for nonsmooth DC optimization
- An incremental clustering algorithm based on hyperbolic smoothing
- Subgradient method for nonconvex nonsmooth optimization
- A multidimensional descent method for global optimization
- A sharp augmented Lagrangian-based method in constrained non-convex optimization
- The gradient discretisation method
- Conjugate gradient type methods for the nondifferentiable convex minimization
- Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms
- Algorithmic construction of the subdifferential from directional derivatives
- A novel piecewise linear classifier based on polyhedral conic and max-min separabilities
- DGM
- Essentials of numerical nonsmooth optimization
- A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
- A convergence analysis of the method of codifferential descent
- A splitting bundle approach for non-smooth non-convex minimization
- 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
- Codifferential method for minimizing nonsmooth DC functions
- Subgradient and bundle methods for nonsmooth optimization
- A derivative-free method for linearly constrained nonsmooth optimization
- A nonsmooth trust-region method for locally Lipschitz functions with application to optimization problems constrained by variational inequalities
- Derivative-free optimization methods for finite minimax problems
- A quasisecant method for solving a system of nonsmooth equations
- Optimal atomic-resolution structures of prion AGAAAAGA amyloid fibrils
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
- Separation of convex sets by Clarke subdifferential
- Interior epigraph directions method for nonsmooth and nonconvex optimization via generalized augmented Lagrangian duality
- Aggregate subgradient method for nonsmooth DC optimization
- A new algorithm for the minimax location problem with the closest distance
- Full-low evaluation methods for derivative-free optimization
- A clustering heuristic to improve a derivative-free algorithm for nonsmooth optimization
- Weak subgradient method for solving nonsmooth nonconvex optimization problems
- Essentials of numerical nonsmooth optimization
- A novel optimization approach towards improving separability of clusters
This page was built for publication: Discrete gradient method: Derivative-free method for nonsmooth optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q946181)
