A discussion on variational analysis in derivative-free optimization (Q829491): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(10 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: ORBIT / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Boosters / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: COBYLA2 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ASTRO-DF / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: BOBYQA / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GradSamp / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: DFO-TRNS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MOIF / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11228-020-00556-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3088043574 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence results for generalized pattern search algorithms are tight / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotonic grey box direct search optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Generalized Pattern Searches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mesh Adaptive Direct Search Algorithms for Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globalization strategies for mesh adaptive direct search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derivative-Free and Blackbox Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic construction of the subdifferential from directional derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducing the Number of Function Evaluations in Mesh Adaptive Direct Search Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust optimization of noisy blackbox problems using the mesh adaptive direct search algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Mesh Adaptive Direct Search Algorithm for Granular and Discrete Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mesh adaptive direct search algorithm for multiobjective optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mesh-based Nelder-Mead algorithm for inequality constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete gradient method: Derivative-free method for nonsmooth optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derivative-Free Optimization of Noisy Functions via Quasi-Newton Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONDOR, a new parallel, constrained extension of Powell's UOBYQA algorithm: Experimental results and comparison with the DFO algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization Methods for Large-Scale Machine Learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic optimization using a trust-region method and random models / rank
 
Normal rank
Property / cites work
 
Property / cites work: An implicit filtering algorithm for derivative-free multiobjective optimization with box constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4421356 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry of sample sets in derivative-free optimization: polynomial regression and underdetermined interpolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Derivative-Free Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4524222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient calculation of regular simplex gradients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Direct Multisearch for Multiobjective Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3451268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compositions of convex functions and fully linear models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive Interpolation Strategies in Derivative-Free Optimization: a case study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calculus Identities for Generalized Simplex Gradients: Rules and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A derivative-free approximate gradient sampling algorithm for finite minimax problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A derivative-free 𝒱𝒰-algorithm for convex finite-max problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proximal bundle method for nonsmooth nonconvex functions with inexact information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derivative-free optimization via proximal point methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: `` Direct Search'' Solution of Numerical and Statistical Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Manifold Sampling for Optimization of Nonconvex Functions That Are Piecewise Linear Compositions of Smooth Components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Manifold Sampling for $\ell_1$ Nonconvex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derivative-free optimization methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: GOSH: derivative-free global optimization using multi-dimensional space-filling curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trust-Region Methods for the Derivative-Free Optimization of Nonsmooth Black-Box Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derivative-free robust optimization by outer approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A superlinearly convergent algorithm for minimization without evaluating derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surrogate Optimization of Computationally Expensive Black-Box Problems with Hidden Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simplex Method for Function Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Stochastic Line Search Method with Expected Complexity Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Precision Control for Generalized Pattern Search Algorithms with Adaptive Precision Function Evaluations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4308910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: UOBYQA: unconstrained optimization by quadratic approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On trust region methods for unconstrained minimization without derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Least Frobenius norm updating of quadratic models that satisfy interpolation conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The calculus of simplex gradients / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the properties of positive spanning sets and positive bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel radial basis function methods for the global optimization of expensive functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derivative-free optimization: a review of algorithms and comparison of software implementations / rank
 
Normal rank
Property / cites work
 
Property / cites work: ASTRO-DF: A Class of Adaptive Sampling Trust-Region Algorithms for Derivative-Free Stochastic Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Convergence of Pattern Search Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the construction of quadratic models for derivative-free trust-region algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: ORBIT: Optimization by Radial Basis Function Interpolation in Trust-Regions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Convergence of Radial Basis Function Trust Region Derivative-Free Algorithms / rank
 
Normal rank

Latest revision as of 16:57, 25 July 2024

scientific article
Language Label Description Also known as
English
A discussion on variational analysis in derivative-free optimization
scientific article

    Statements

    A discussion on variational analysis in derivative-free optimization (English)
    0 references
    6 May 2021
    0 references
    Derivative-Free Optimization (DFO) is the mathematical study of algorithms for continuous optimization that do not use first-order information. Thus, by definition, DFO studies algorithms that do not use derivatives, gradients, directional derivatives, subgradients, normal cones, tangent cones, etc. As such, it might seem that Variational Analysis would have limited value in DFO research. However, a study of DFO shows that this is a false conclusion. In fact, the many of the most successful DFO algorithms rely heavily on tools and results from Variational Analysis. In this paper, the author highlights some of this research and argue that Variational Analysis is a critical component to studying DFO.
    0 references
    0 references
    derivative-free optimization
    0 references
    variational analysis
    0 references
    direct-search method
    0 references
    model-based methods
    0 references
    order-\(N\) accuracy
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers