Piecewise partially separable functions and a derivative-free algorithm for large scale nonsmooth optimization

DOI10.1007/s10898-005-3834-4zbMath1136.90515OpenAlexW2145313796MaRDI QIDQ2501110

Julien Ugon, Adil M. Bagirov

Publication date: 4 September 2006

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/58638

zbMATH Keywords

nonsmooth optimizationsubdifferentiallarge scale optimizationdiscrete gradientpiecewise partially separable functions

Mathematics Subject Classification ID

Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)

Related Items

Direct search nonsmooth constrained optimization via rounded ℓ₁ penalty functions, An incremental piecewise linear classifier based on polyhedral conic separation, A novel piecewise linear classifier based on polyhedral conic and max-min separabilities, A DIRECT SEARCH QUASI-NEWTON METHOD FOR NONSMOOTH UNCONSTRAINED OPTIMIZATION, A sharp augmented Lagrangian-based method in constrained non-convex optimization, Nonsmooth cryptanalysis, with an application to the stream cipher MICKEY, An incremental nonsmooth optimization algorithm for clustering using \(L_1\) and \(L_\infty\) norms, An algorithm for the estimation of a regression function by continuous piecewise linear functions, Gradient-free method for nonsmooth distributed optimization, \textsc{Oscars}-II: an algorithm for bound constrained global optimization, Derivative-free optimization methods, Nonsmooth optimization algorithm for solving clusterwise linear regression problems, Non-smooth optimization based on resilient backpropagation search for unconstrained and simply bounded problems

Uses Software

• MINPACK-2
• ve08
• LDGB

Cites Work

• Unnamed Item
• Unnamed Item
• Continuous subdifferential approximations and their applications
• Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder)
• UOBYQA: unconstrained optimization by quadratic approximation
• A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
• Semismooth and Semiconvex Functions in Constrained Optimization
• Computing Large Sparse Jacobian Matrices Using Automatic Differentiation
• A Method for Minimization of Quasidifferentiable Functions
• An algorithm for minimizing clustering functions
• New limited memory bundle method for large-scale nonsmooth optimization
• A numerical method for finding best guaranteed estimates