A Method for Minimization of Quasidifferentiable Functions

From MaRDI portal
Publication:4806341

DOI10.1080/10556780290027837zbMath1040.90038OpenAlexW2052090003MaRDI QIDQ4806341

Adil M. Bagirov

Publication date: 2002

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556780290027837




Related Items (35)

DETECTING K-COMPLEXES FOR SLEEP STAGE IDENTIFICATION USING NONSMOOTH OPTIMIZATIONOptimization conditions and decomposable algorithms for convertible nonconvex optimizationA proximal alternating linearization method for nonconvex optimization problemsAn algorithm for minimizing clustering functionsMax–min separabilityA proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planesOn quasidifferentiable mathematical programs with equilibrium constraintsA bundle-type method for nonsmooth DC programsA proximal bundle method for a class of nonconvex nonsmooth composite optimization problemsComputing of high breakdown regression estimators without sorting on graphics processing unitsA novel piecewise linear classifier based on polyhedral conic and max-min separabilitiesNonsmooth cryptanalysis, with an application to the stream cipher MICKEYA redistributed bundle algorithm based on local convexification models for nonlinear nonsmooth DC programmingMinimizing nonsmooth DC functions via successive DC piecewise-affine approximationsA convergence analysis of the method of codifferential descentAn approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimizationCodifferential method for minimizing nonsmooth DC functionsGlobal non-smooth optimization in robust multivariate regressionSmoothing Lipschitz functionsMonotonicity preserving approximation of multivariate scattered dataDensity based fuzzy \(c\)-means clustering of non-convex patternsProximal bundle methods for nonsmooth DC programmingPiecewise partially separable functions and a derivative-free algorithm for large scale nonsmooth optimizationA multidimensional descent method for global optimizationClassification through incremental max-min separabilityCharacterization of nonsmooth quasiconvex functions and their Greenberg-Pierskalla's subdifferentials using semi-quasidifferentiability notionAn effective adaptive trust region algorithm for nonsmooth minimizationDouble Bundle Method for finding Clarke Stationary Points in Nonsmooth DC ProgrammingAn interior proximal linearized method for DC programming based on Bregman distance or second-order homogeneous kernelsSemi-quasidifferentiability in nonsmooth nonconvex multiobjective optimizationA new nonsmooth optimization algorithm for minimum sum-of-squares clustering problemsNon-smooth optimization methods for computation of the Conditional Value-at-risk and portfolio optimizationWeak subgradient method for solving nonsmooth nonconvex optimization problemsLocal optimization method with global multidimensional searchDerivative-free optimization and neural networks for robust regression



Cites Work


This page was built for publication: A Method for Minimization of Quasidifferentiable Functions