Discrete gradient method: Derivative-free method for nonsmooth optimization
From MaRDI portal
Publication:946181
DOI10.1007/s10957-007-9335-5zbMath1165.90021OpenAlexW2048153686MaRDI QIDQ946181
Publication date: 22 September 2008
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/11511/32669
Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)
Related Items (58)
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 ⋮ 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 ⋮ A new algorithm for the minimax location problem with the closest distance ⋮ Numerical infinitesimals in a variable metric method for convex nonsmooth optimization ⋮ Conjugate gradient type methods for the nondifferentiable convex minimization ⋮ A novel optimization approach towards improving separability of clusters ⋮ A clustering heuristic to improve a derivative-free algorithm for 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 ⋮ A DIRECT SEARCH QUASI-NEWTON METHOD FOR NONSMOOTH UNCONSTRAINED OPTIMIZATION ⋮ A sharp augmented Lagrangian-based method in constrained non-convex optimization ⋮ Interior epigraph directions method for nonsmooth and nonconvex optimization via generalized augmented Lagrangian duality ⋮ Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms ⋮ 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 ⋮ Codifferential method for minimizing nonsmooth DC functions ⋮ Derivative-free optimization methods for finite minimax problems ⋮ An algorithm for the estimation of a regression function by continuous piecewise linear functions ⋮ A multidimensional descent method for global optimization ⋮ Optimal atomic-resolution structures of prion AGAAAAGA amyloid fibrils ⋮ Testing different nonsmooth formulations of the Lennard-Jones potential in atomic clustering problems ⋮ 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 ⋮ Diagonal discrete gradient bundle method for derivative free nonsmooth optimization ⋮ DGM ⋮ A difference of convex optimization algorithm for piecewise linear regression ⋮ Derivative-free optimization methods ⋮ Subgradient and Bundle Methods for Nonsmooth Optimization ⋮ Hyperbolic smoothing function method for minimax problems ⋮ A splitting bundle approach for non-smooth non-convex minimization ⋮ 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 ⋮ An incremental clustering algorithm based on hyperbolic smoothing ⋮ 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 ⋮ A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithms for finite and semi-infinite Min-Max-Min problems using adaptive smoothing techniques
- Continuous subdifferential approximations and their applications
- Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder)
- Methods of descent for nondifferentiable optimization
- Solving semidefinite quadratic problems within nonsmooth optimization algorithms
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
- On the Convergence of Pattern Search Algorithms
- Optimization and nonsmooth analysis
- A Dual Method for Certain Positive Semidefinite Quadratic Programming Problems
- A bundle type approach to the unconstrained minimization of convex nonsmooth functions
- Finding the nearest point in A polytope
- Semismooth and Semiconvex Functions in Constrained Optimization
- An Algorithm for Constrained Optimization with Semismooth Functions
- Analysis of Generalized Pattern Searches
- Generalized Bundle Methods
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
This page was built for publication: Discrete gradient method: Derivative-free method for nonsmooth optimization
