Piecewise Partially Separable Functions and a Derivative-free Algorithm for Large Scale Nonsmooth Optimization

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.

[1]  Adil M. Bagirov,et al.  A Method for Minimization of Quasidifferentiable Functions , 2002, Optim. Methods Softw..

[2]  F. Clarke.  Optimization And Nonsmooth Analysis , 1983 .

[3]  Kaisa Miettinen,et al.  New limited memory bundle method for large-scale nonsmooth optimization , 2004, Optim. Methods Softw..

[4]  A. Rubinov,et al.  Unsupervised and supervised data classification via nonsmooth and global optimization , 2003 .

[5]  Andreas Griewank,et al.  Computing Large Sparse Jacobian Matrices Using Automatic Differentiation , 1994, SIAM J. Sci. Comput..

[6]  Pierre Hansen,et al.  Cluster analysis and mathematical programming , 1997, Math. Program..

[7]  Adil M. Bagirov,et al.  A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems , 2006, Eur. J. Oper. Res..

[8]  J. Hiriart-Urruty,et al.  Convex analysis and minimization algorithms , 1993 .

[9]  Adil M. Bagirov.  Minimization Methods for One Class of Nonsmooth Functions and Calculation of Semi-Equilibrium Prices , 1999 .

[10]  John A. Nelder,et al.  A Simplex Method for Function Minimization , 1965, Comput. J..

[11]  R. Mifflin.  Semismooth and Semiconvex Functions in Constrained Optimization , 1977 .

[12]  V. F. Demʹi︠a︡nov,et al.  Constructive nonsmooth analysis , 1995 .

[13]  Adil M. Bagirov,et al.  A method of approximating a quasidifferential , 1992 .

[14]  Adil M. Bagirov,et al.  An algorithm for minimizing clustering functions , 2005 .

[15]  Yu. G. Evtushenko.  A numerical method for finding best guaranteed estimates , 1972 .

[16]  M. J. D. Powell,et al.  UOBYQA: unconstrained optimization by quadratic approximation , 2002, Math. Program..

[17]  Andreas Griewank,et al.  On the unconstrained optimization of partially separable functions , 1982 .

[18]  Philippe L. Toint,et al.  A Derivative-Free Algorithm for Sparse Unconstrained Optimization Problems , 2002 .

[19]  A. Bagirov.  Continuous Subdifferential Approximations and Their Applications , 2003 .

[20]  P. Toint,et al.  Improving the Decomposition of Partially Separable Functions in the Context of Large-Scale Optimization: a First Approach· , 1993 .

[21]  K. Kiwiel.  Methods of Descent for Nondifferentiable Optimization , 1985 .

[22]  Anil K. Jain,et al.  Data clustering: a review , 1999, CSUR.

[23]  Adil M. Bagirov,et al.  Max–min separability , 2005, Optim. Methods Softw..

[24]  V. S. Vladimirov,et al.  P-adic analysis and mathematical physics , 1994 .