Lost in optimisation of water distribution systems? A literature review of system operation
H Mala-Jetmarova, N Sultanova, D Savic - Environmental modelling & …, 2017 - Elsevier
Optimisation of the operation of water distribution systems has been an active research field
for almost half a century. It has focused mainly on optimal pump operation to minimise …
for almost half a century. It has focused mainly on optimal pump operation to minimise …
[BOOK][B] Aggregation functions: A guide for practitioners
G Beliakov, A Pradera, T Calvo - 2007 - Springer
The target audience of this book are computer scientists, system architects, knowledge
engineers and programmers, who face a problem of combining various inputs into a single …
engineers and programmers, who face a problem of combining various inputs into a single …
Proximal bundle methods for nonsmooth DC programming
W de Oliveira - Journal of Global Optimization, 2019 - Springer
We consider the problem of minimizing the difference of two nonsmooth convex functions
over a simple convex set. To deal with this class of nonsmooth and nonconvex optimization …
over a simple convex set. To deal with this class of nonsmooth and nonconvex optimization …
Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
We introduce a proximal bundle method for the numerical minimization of a nonsmooth
difference-of-convex (DC) function. Exploiting some classic ideas coming from cutting-plane …
difference-of-convex (DC) function. Exploiting some classic ideas coming from cutting-plane …
A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
AM Bagirov, J Yearwood - European journal of operational research, 2006 - Elsevier
The minimum sum-of-squares clustering problem is formulated as a problem of nonsmooth,
nonconvex optimization, and an algorithm for solving the former problem based on …
nonconvex optimization, and an algorithm for solving the former problem based on …
Double bundle method for finding Clarke stationary points in nonsmooth DC programming
The aim of this paper is to introduce a new proximal double bundle method for
unconstrained nonsmooth optimization, where the objective function is presented as a …
unconstrained nonsmooth optimization, where the objective function is presented as a …
Unsupervised and supervised data classification via nonsmooth and global optimization
AM Bagirov, AM Rubinov, NV Soukhoroukova… - Top, 2003 - Springer
We examine various methods for data clustering and data classification that are based on
the minimization of the so-called cluster function and its modications. These functions are …
the minimization of the so-called cluster function and its modications. These functions are …
A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
In this paper, we develop a version of the bundle method to solve unconstrained difference
of convex (DC) programming problems. It is assumed that a DC representation of the …
of convex (DC) programming problems. It is assumed that a DC representation of the …
OWA operators in regression problems
RR Yager, G Beliakov - IEEE Transactions on Fuzzy Systems, 2009 - ieeexplore.ieee.org
We consider an application of fuzzy logic connectives to statistical regression. We replace
the standard least squares, least absolute deviation, and maximum likelihood criteria with an …
the standard least squares, least absolute deviation, and maximum likelihood criteria with an …
Semi-quasidifferentiability in nonsmooth nonconvex multiobjective optimization
A Kabgani, M Soleimani-Damaneh - European Journal of Operational …, 2022 - Elsevier
In this paper, we extend the concept of quasidifferential to a new notion called semi-
quasidifferential. This generalization is motivated by the convexificator notion. Some …
quasidifferential. This generalization is motivated by the convexificator notion. Some …