A Method for Minimization of Quasidifferentiable Functions
From MaRDI portal
Publication:4806341
DOI10.1080/10556780290027837zbMath1040.90038OpenAlexW2052090003MaRDI QIDQ4806341
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
DETECTING K-COMPLEXES FOR SLEEP STAGE IDENTIFICATION USING NONSMOOTH OPTIMIZATION, Optimization conditions and decomposable algorithms for convertible nonconvex optimization, A proximal alternating linearization method for nonconvex optimization problems, An algorithm for minimizing clustering functions, Max–min separability, A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes, On quasidifferentiable mathematical programs with equilibrium constraints, A bundle-type method for nonsmooth DC programs, A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems, Computing of high breakdown regression estimators without sorting on graphics processing units, A novel piecewise linear classifier based on polyhedral conic and max-min separabilities, Nonsmooth cryptanalysis, with an application to the stream cipher MICKEY, A redistributed bundle algorithm based on local convexification models for nonlinear nonsmooth DC programming, Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations, A convergence analysis of the method of codifferential descent, An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization, Codifferential method for minimizing nonsmooth DC functions, Global non-smooth optimization in robust multivariate regression, Smoothing Lipschitz functions, Monotonicity preserving approximation of multivariate scattered data, Density based fuzzy \(c\)-means clustering of non-convex patterns, Proximal bundle methods for nonsmooth DC programming, Piecewise partially separable functions and a derivative-free algorithm for large scale nonsmooth optimization, A multidimensional descent method for global optimization, Classification through incremental max-min separability, Characterization of nonsmooth quasiconvex functions and their Greenberg-Pierskalla's subdifferentials using semi-quasidifferentiability notion, An effective adaptive trust region algorithm for nonsmooth minimization, Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming, An interior proximal linearized method for DC programming based on Bregman distance or second-order homogeneous kernels, Semi-quasidifferentiability in nonsmooth nonconvex multiobjective optimization, A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems, Non-smooth optimization methods for computation of the Conditional Value-at-risk and portfolio optimization, Weak subgradient method for solving nonsmooth nonconvex optimization problems, Local optimization method with global multidimensional search, Derivative-free optimization and neural networks for robust regression
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proximity control in bundle methods for convex nondifferentiable minimization
- A method of truncated codifferential with application to some problems of cluster analysis
- Algorithm Models for Nondifferentiable Optimization
- Optimization and nonsmooth analysis
- A note on the existence of subgradients
- On the Extension of Constrained Optimization Algorithms from Differentiable to Nondifferentiable Problems
- Finding the nearest point in A polytope
- Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries
- Quasi-Newton Bundle-Type Methods for Nondifferentiable Convex Optimization
- A method for minimizing convex functions based on continuous approximations to the subdifferential
- Finding the Point of a Polyhedron Closest to the Origin
- A Globally and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization
- Convex Analysis
- Convex analysis and global optimization
