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

DOI10.1007/S10898-005-3834-4MaRDI QIDQ2501110zbMATH OpenOpenAlexFDO

Authors Julien Ugon, A. 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

discrete gradientlarge scale optimizationnonsmooth optimizationpiecewise partially separable functionssubdifferential

Mathematics Subject Classification ID

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

Recommendations

• Variable metrid method for minimization of partially separable nonsmooth functions
• Optimizing partially separable functions without derivatives
• scientific article; zbMATH DE number 3898623
• scientific article; zbMATH DE number 3843081
• scientific article; zbMATH DE number 679859

Cites work

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

Cited in

(18)

• A novel piecewise linear classifier based on polyhedral conic and max-min separabilities
• Gradient-free method for nonsmooth distributed optimization
• \textsc{Oscars}-II: an algorithm for bound constrained global optimization
• 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
• Nonsmooth optimization algorithm for solving clusterwise linear regression problems
• Non-smooth optimization based on resilient backpropagation search for unconstrained and simply bounded problems
• Nonsmooth cryptanalysis, with an application to the stream cipher MICKEY
• scientific article; zbMATH DE number 3843081 (Why is no real title available?)
• scientific article; zbMATH DE number 3898623 (Why is no real title available?)
• scientific article; zbMATH DE number 679859 (Why is no real title available?)
• A direct search quasi-Newton method for nonsmooth unconstrained optimization
• A sharp augmented Lagrangian-based method in constrained non-convex optimization
• Direct search nonsmooth constrained optimization via rounded ℓ₁ penalty functions
• Derivative-free optimization methods
• Variable metrid method for minimization of partially separable nonsmooth functions
• Optimizing partially separable functions without derivatives
• An incremental piecewise linear classifier based on polyhedral conic separation

Describes a project that uses

Uses Software

• MINPACK-2
• ve08
• LDGB

This page was built for publication: Piecewise partially separable functions and a derivative-free algorithm for large scale nonsmooth optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2501110)