The following pages link to DGM (Q18293):
Displaying 46 items.
- Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization (Q285034) (← links)
- Subgradient method for nonconvex nonsmooth optimization (Q353174) (← links)
- A derivative-free approximate gradient sampling algorithm for finite minimax problems (Q360384) (← links)
- A quasisecant method for solving a system of nonsmooth equations (Q524563) (← links)
- Codifferential method for minimizing nonsmooth DC functions (Q539496) (← links)
- A discussion on variational analysis in derivative-free optimization (Q829491) (← links)
- Improved convergence result for the discrete gradient and secant methods for nonsmooth optimization (Q848722) (← links)
- An incremental piecewise linear classifier based on polyhedral conic separation (Q890307) (← links)
- Nonsmooth multiobjective problems and generalized vector variational inequalities using quasi-efficiency (Q1626531) (← links)
- A convergence analysis of the method of codifferential descent (Q1756589) (← links)
- An effective nonsmooth optimization algorithm for locally Lipschitz functions (Q1934631) (← links)
- A novel piecewise linear classifier based on polyhedral conic and max-min separabilities (Q1948524) (← links)
- Aggregate subgradient method for nonsmooth DC optimization (Q1996741) (← links)
- A geometric integration approach to nonsmooth, nonconvex optimisation (Q2088134) (← links)
- An incremental nonsmooth optimization algorithm for clustering using \(L_1\) and \(L_\infty\) norms (Q2244241) (← links)
- An algorithm for the estimation of a regression function by continuous piecewise linear functions (Q2268929) (← links)
- A difference of convex optimization algorithm for piecewise linear regression (Q2313774) (← links)
- Two structure-preserving time discretizations for gradient flows (Q2338086) (← links)
- A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems (Q2342127) (← links)
- Nonsmooth optimization algorithm for solving clusterwise linear regression problems (Q2342128) (← links)
- Aggregate codifferential method for nonsmooth DC optimization (Q2349678) (← links)
- Algorithmic construction of the subdifferential from directional derivatives (Q2413566) (← links)
- Computing proximal points of convex functions with inexact subgradients (Q2413568) (← links)
- A simple version of bundle method with linear programming (Q2419511) (← links)
- Numerical infinitesimals in a variable metric method for convex nonsmooth optimization (Q2422878) (← links)
- Solving dual problems using a coevolutionary optimization algorithm (Q2434646) (← links)
- An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization (Q2483018) (← links)
- Subgradient and Bundle Methods for Nonsmooth Optimization (Q2838345) (← links)
- Comparing different nonsmooth minimization methods and software (Q2885467) (← links)
- Introduction to Nonsmooth Optimization (Q2925836) (← links)
- Separation of convex sets by Clarke subdifferential (Q3066929) (← links)
- Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization (Q3145057) (← links)
- A quasisecant method for minimizing nonsmooth functions (Q3562378) (← links)
- Gradient set splitting in nonconvex nonsmooth numerical optimization (Q3562383) (← links)
- Manifold Sampling for Optimization of Nonconvex Functions That Are Piecewise Linear Compositions of Smooth Components (Q4554066) (← links)
- Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms (Q4638918) (← links)
- Weak subgradient method for solving nonsmooth nonconvex optimization problems (Q5009157) (← links)
- A derivative-free 𝒱𝒰-algorithm for convex finite-max problems (Q5113714) (← links)
- A Nonsmooth Trust-Region Method for Locally Lipschitz Functions with Application to Optimization Problems Constrained by Variational Inequalities (Q5116553) (← links)
- Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions (Q5162654) (← links)
- Trust-Region Methods for the Derivative-Free Optimization of Nonsmooth Black-Box Functions (Q5203798) (← links)
- Derivative-free optimization methods (Q5230522) (← links)
- Full-low evaluation methods for derivative-free optimization (Q5882241) (← links)
- Essentials of numerical nonsmooth optimization (Q5918756) (← links)
- A proximal bundle method for nonsmooth nonconvex functions with inexact information (Q5963307) (← links)
- Essentials of numerical nonsmooth optimization (Q5970841) (← links)
