Pages that link to "Item:Q4806341"
From MaRDI portal
The following pages link to A Method for Minimization of Quasidifferentiable Functions (Q4806341):
Displayed 34 items.
- Computing of high breakdown regression estimators without sorting on graphics processing units (Q425179) (← links)
- Codifferential method for minimizing nonsmooth DC functions (Q539496) (← links)
- Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations (Q1754446) (← links)
- A convergence analysis of the method of codifferential descent (Q1756589) (← links)
- An effective adaptive trust region algorithm for nonsmooth minimization (Q1790684) (← links)
- A novel piecewise linear classifier based on polyhedral conic and max-min separabilities (Q1948524) (← links)
- A redistributed bundle algorithm based on local convexification models for nonlinear nonsmooth DC programming (Q1983659) (← links)
- Characterization of nonsmooth quasiconvex functions and their Greenberg-Pierskalla's subdifferentials using semi-quasidifferentiability notion (Q2032013) (← links)
- Semi-quasidifferentiability in nonsmooth nonconvex multiobjective optimization (Q2077957) (← links)
- Proximal bundle methods for nonsmooth DC programming (Q2274891) (← links)
- Classification through incremental max-min separability (Q2281967) (← links)
- A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes (Q2399479) (← links)
- An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization (Q2483018) (← links)
- Monotonicity preserving approximation of multivariate scattered data (Q2490358) (← links)
- Density based fuzzy \(c\)-means clustering of non-convex patterns (Q2497254) (← links)
- Piecewise partially separable functions and a derivative-free algorithm for large scale nonsmooth optimization (Q2501110) (← links)
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems (Q2572256) (← links)
- Local optimization method with global multidimensional search (Q2576444) (← links)
- DETECTING <i>K</i>-COMPLEXES FOR SLEEP STAGE IDENTIFICATION USING NONSMOOTH OPTIMIZATION (Q2883243) (← links)
- A proximal alternating linearization method for nonconvex optimization problems (Q2926053) (← links)
- Nonsmooth cryptanalysis, with an application to the stream cipher MICKEY (Q2999550) (← links)
- Derivative-free optimization and neural networks for robust regression (Q3145056) (← links)
- Non-smooth optimization methods for computation of the Conditional Value-at-risk and portfolio optimization (Q3426227) (← links)
- Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming (Q4571882) (← links)
- Global non-smooth optimization in robust multivariate regression (Q4924107) (← links)
- Weak subgradient method for solving nonsmooth nonconvex optimization problems (Q5009157) (← links)
- Optimization conditions and decomposable algorithms for convertible nonconvex optimization (Q5058177) (← links)
- A multidimensional descent method for global optimization (Q5193141) (← links)
- An interior proximal linearized method for DC programming based on Bregman distance or second-order homogeneous kernels (Q5228821) (← links)
- An algorithm for minimizing clustering functions (Q5317732) (← links)
- Max–min separability (Q5317750) (← links)
- Smoothing Lipschitz functions (Q5426972) (← links)
- On quasidifferentiable mathematical programs with equilibrium constraints (Q6134301) (← links)
- A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems (Q6173956) (← links)