A Method for Minimization of Quasidifferentiable Functions
From MaRDI portal
Recommendations
- Descent methods for quasidifferentiable minimization
- A gradient-like method for quasidifferentiable optimization
- scientific article; zbMATH DE number 1539044
- The method of common descent for a certain class of quasidifferentiable functions
- Quasidifferentiable functions: Necessary conditions and descent directions
Cites work
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 3932969 (Why is no real title available?)
- scientific article; zbMATH DE number 3804766 (Why is no real title available?)
- scientific article; zbMATH DE number 872150 (Why is no real title available?)
- A Globally and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization
- A method for minimizing convex functions based on continuous approximations to the subdifferential
- A method of truncated codifferential with application to some problems of cluster analysis
- A note on the existence of subgradients
- Algorithm Models for Nondifferentiable Optimization
- Convex Analysis
- Convex analysis and global optimization
- Finding the Point of a Polyhedron Closest to the Origin
- Finding the nearest point in A polytope
- On the Extension of Constrained Optimization Algorithms from Differentiable to Nondifferentiable Problems
- Optimization and nonsmooth analysis
- Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries
- Proximity control in bundle methods for convex nondifferentiable minimization
- Quasi-Newton Bundle-Type Methods for Nondifferentiable Convex Optimization
Cited in
(41)- scientific article; zbMATH DE number 38035 (Why is no real title available?)
- A redistributed bundle algorithm based on local convexification models for nonlinear nonsmooth DC programming
- Classification through incremental max-min separability
- Smoothing Lipschitz functions
- On quasidifferentiable mathematical programs with equilibrium constraints
- Density based fuzzy \(c\)-means clustering of non-convex patterns
- Codifferential method for minimizing nonsmooth DC functions
- An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization
- Computing of high breakdown regression estimators without sorting on graphics processing units
- A bundle-type method for nonsmooth DC programs
- Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
- Quasidifferentiable functions: Necessary conditions and descent directions
- Double bundle method for finding Clarke stationary points in nonsmooth DC programming
- A method of approximating a quasidifferential
- A convergence analysis of the method of codifferential descent
- Proximal bundle methods for nonsmooth DC programming
- Detecting \(K\)-complexes for sleep stage identification using nonsmooth optimization
- A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
- An effective adaptive trust region algorithm for nonsmooth minimization
- Global non-smooth optimization in robust multivariate regression
- Max–min separability
- A proximal alternating linearization method for nonconvex optimization problems
- An algorithm for minimizing clustering functions
- Local optimization method with global multidimensional search
- Non-smooth optimization methods for computation of the Conditional Value-at-risk and portfolio optimization
- Derivative-free optimization and neural networks for robust regression
- Randomized search directions in descent methods for minimizing certain quasidifferentiable functions
- Nonsmooth cryptanalysis, with an application to the stream cipher MICKEY
- A quasisecant method for minimizing nonsmooth functions
- scientific article; zbMATH DE number 1539044 (Why is no real title available?)
- Characterization of nonsmooth quasiconvex functions and their Greenberg-Pierskalla's subdifferentials using semi-quasidifferentiability notion
- Optimization conditions and decomposable algorithms for convertible nonconvex optimization
- Weak subgradient method for solving nonsmooth nonconvex optimization problems
- An interior proximal linearized method for DC programming based on Bregman distance or second-order homogeneous kernels
- A multidimensional descent method for global optimization
- Semi-quasidifferentiability in nonsmooth nonconvex multiobjective optimization
- Piecewise partially separable functions and a derivative-free algorithm for large scale nonsmooth optimization
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
- A novel piecewise linear classifier based on polyhedral conic and max-min separabilities
- Monotonicity preserving approximation of multivariate scattered data
- A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems
This page was built for publication: A Method for Minimization of Quasidifferentiable Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4806341)
