Abstract
This paper introduces the notion of piecewise partially separable functions and studies their properties. We also consider some of many applications of these functions. Finally, we consider the problem of minimizing of piecewise partially separable functions and develop an algorithm for its solution. This algorithm exploits the structure of such functions. We present the results of preliminary numerical experiments.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
B.M. Aberick C.H. Bicshof A. Carle J. More A. Griewank (1994) ArticleTitleComputing large sparse Jacobian matrices using automatic differentiation SIAM Journal on Scientific and Statistical Computing 15 285–294 Occurrence Handle10.1137/0915020
A.M. Bagirov A.A. Gasanov (1995) ArticleTitleA method of approximating a quasidifferential Russian Journal of Computational Mathematics and Mathematical Physics 35 IssueID4 403–409
Bagirov, A.M. (1999), Minimization methods for one class of nonsmooth functions and calculation of semi-equilibrium prices, In: Eberhard, A. et al. (eds.) Progress in Optimization: Contribution from Australasia, Kluwer Academic Publishers, pp. 147–175.
A.M. Bagirov (2002) ArticleTitleA method for minimzation of quasidifferentiable functions Optimization Methods and Software 17 IssueID1 31–60 Occurrence Handle10.1080/10556780290027837
A.M. Bagirov (2003) ArticleTitleContinuous subdifferential approximations and their applications Journal of Mathematical Sciences 115 IssueID5 2567–2609 Occurrence Handle10.1023/A:1023227716953
Bagirov, A.M., Rubinov, A.M., Soukhoroukova, N.V. and Yearwood, J. (2003), Unsupervised and supervised data classification via nonsmooth and global optimization, TOP: Spanish Journal of Operations Research 1–93.
A.M. Bagirov J. Ugon (2005) ArticleTitleAn algorithm for minimizing clustering functions Optimization 54 IssueID4–5 351–368 Occurrence Handle10.1080/02331930500096155
Bagirov, A.M. Max-min separability, Optmization Methods and Software. 20(2–3): 271–290
Bagirov, A.M. and Yearwood J. A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems, European Journal of Operational Research 170(2), 578–596.
H.H. Bock (1974) Automatische Klassifikation Vandenhoeck & Ruprecht Gottingen
F.H. Clarke (1983) Optimization and Nonsmooth Analysis Wiley New York
B. Colson Ph.L. Toint (2002) A derivative-free algorithm for sparse unconstrained optimization problems A.H Siddiqi M. Kocvara (Eds) Trends in Industrial and Applied Mathematics Kluwer Academic Publishers Dordrecht 131–147
A.R. Conn N. Gould Ph.L. Toint (1994) Improving the decomposition of partially separable functions in the context of large-scale optimization: a first approach W.W. Hager D.W. Hearn P.M. Pardalos (Eds) Large Scale Optimization: State of the Art Kluwer Academic Publishers Dordrecht 82–94
V.F. Demyanov A.M. Rubinov (1995) Constructive Nonsmooth Analysis Peter Lang Frankfurt am Main
Yu.G. Evtushenko (1972) ArticleTitleA numerical method for finding best guaranteed estimates USSR Journal of Computational Mathematics and Mathematical Physics 12 109–128 Occurrence Handle10.1016/0041-5553(72)90068-7
Griewank, A. and Toint, Ph.L. (1982), On the unconstrained optimization of partially separable functions, In: Powell, M.J.D. (ed.), Nonlinear Optimization, Academic Press, pp. 301–312.
M. Haarala K. Miettinen M.M. Makela (2004) ArticleTitleNew-limited memory bundle method for large-scale nonsmooth optimization Optimization Methods and Software 19 IssueID6 673–692 Occurrence Handle10.1080/10556780410001689225
P. Hansen B. Jaumard (1997) ArticleTitleCluster analysis and mathematical programming Mathematical Programming 79 IssueID1–3 191–215 Occurrence Handle10.1016/S0025-5610(97)00059-2
J.-P. Hiriart-Urruty C. Lemarechal (1993) Convex Analysis and Minimization Algorithms Vol. 1 and 2 Springer-Verlag Berlin, New York
K.C. Kiwiel (1985) Methods of Descent for Nondifferentiable Optimization, Lecture Notes in Mathematics Springer-Verlag Berlin
A.K. Jain M.N. Murty P.J. Flynn (1999) ArticleTitleData clustering: a review ACM Computing Surveys 31 IssueID3 264–323 Occurrence Handle10.1145/331499.331504
Luksan, L. and Vlcek, J. (1999), Sparse and partially separable test problems for unconstrained and equality constrained optimization, Technical Report 767, Institute of Computer Science, Academy of Sciences of the Czech Republic, Prague.
Luksan, L. and Vlcek, J. (2000), Test problems for nonsmooth unconstrained and linearly constrained optimization, Technical Report 798, Institute of Computer Science, Academy of Sciences of the Czech Republic, Prague.
M.M. Makela P. Neittaanmaki (1992) Nonsmooth Optimization World Scientific Singapore
R. Mifflin (1977) ArticleTitleSemismooth and semiconvex functions in constrained optimization SIAM Journal on Control and Optimization 15 IssueID6 959–972 Occurrence Handle10.1137/0315061
J.A. Nelder R. Mead (1965) ArticleTitleA simplex method for function minimization Computer Journal 7 308–313
M.J.D. Powell (2002) ArticleTitleUOBYQA: unconstrained optimization by quadratic approximation Mathematical Programming 92 IssueID3 555–582 Occurrence Handle10.1007/s101070100290
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bagirov, A.M., Ugon, J. Piecewise Partially Separable Functions and a Derivative-free Algorithm for Large Scale Nonsmooth Optimization. J Glob Optim 35, 163–195 (2006). https://doi.org/10.1007/s10898-005-3834-4
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10898-005-3834-4
Keywords
- discrete gradient
- large scale optimization
- nonsmooth optimization
- piecewise partially separable functions
- subdifferential