Analysis of direct searches for discontinuous functions

DOI10.1007/s10107-010-0429-8zbMath1245.90127OpenAlexW2133356919WikidataQ58040544 ScholiaQ58040544MaRDI QIDQ431012

A. L. Custódio, Luis Nunes Vicente

Publication date: 26 June 2012

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-010-0429-8

zbMATH Keywords

lower semicontinuitydiscontinuityLipschitz extensionsdirect-search methodsdirectionally Lipschitzgeneralized directional derivativesnonsmooth calculus

Mathematics Subject Classification ID

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

Related Items

Optimization with hidden constraints and embedded Monte Carlo computations, Dynamic scaling in the mesh adaptive direct search algorithm for blackbox optimization, A derivative-free affine scaling trust region methods based on probabilistic models with new nonmonotone line search technique for linear inequality constrained minimization without strict complementarity, Full-low evaluation methods for derivative-free optimization, Model-Based Derivative-Free Methods for Convex-Constrained Optimization, Derivative-free methods for mixed-integer nonsmooth constrained optimization, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, Bilevel direct search method for leader-follower problems and application in health insurance, Constrained derivative-free optimization on thin domains, A subclass of generating set search with convergence to second-order stationary points, CARTopt: a random search method for nonsmooth unconstrained optimization, A discontinuous derivative-free optimization framework for multi-enterprise supply chain, Globally convergent evolution strategies for constrained optimization, Escaping Unknown Discontinuous Regions in Blackbox Optimization, On the minimization of possibly discontinuous functions by means of pointwise approximations, TREGO: a trust-region framework for efficient global optimization, Equal angle distribution of polling directions in direct-search methods, Two decades of blackbox optimization applications, Mesh adaptive direct search with second directional derivative-based Hessian update, A DIRECT SEARCH QUASI-NEWTON METHOD FOR NONSMOOTH UNCONSTRAINED OPTIMIZATION, Global optimization of bounded factorable functions with discontinuities, Using QR decomposition to obtain a new instance of mesh adaptive direct search with uniformly distributed polling directions, A variance-based method to rank input variables of the mesh adaptive direct search algorithm, Globally convergent evolution strategies, Optimization of algorithms with OPAL, Calibration of parameters in dynamic energy budget models using direct-search methods, Black-Box Optimization: Methods and Applications, Generating set search using simplex gradients for bound-constrained black-box optimization, Mesh adaptive direct search with simplicial Hessian update, Trust-Region Methods for the Derivative-Free Optimization of Nonsmooth Black-Box Functions, A trust-region-based derivative free algorithm for mixed integer programming, Worst case complexity of direct search, Derivative-free optimization methods, Direct Search Based on Probabilistic Descent, Derivative-free robust optimization for circuit design, GLODS: global and local optimization using direct search

Uses Software

• mctoolbox

Cites Work

• Unnamed Item
• Unnamed Item
• Optimizing Omega
• On the Convergence of Pattern Search Algorithms
• Convergence of Mesh Adaptive Direct Search to Second‐Order Stationary Points
• Using simplex gradients of nonsmooth functions in direct search methods
• Introduction to Derivative-Free Optimization
• Generalized Directional Derivatives and Subgradients of Nonconvex Functions
• Analysis of Generalized Pattern Searches
• Extension of range of functions
• Accuracy and Stability of Numerical Algorithms
• Generating Set Search Methods for Piecewise Smooth Problems
• Optimization by Direct Search in Matrix Computations
• Mesh Adaptive Direct Search Algorithms for Constrained Optimization
• Convex Analysis
• Finding Optimal Algorithmic Parameters Using Derivative‐Free Optimization