Full-low evaluation methods for bound and linearly constrained derivative-free optimization

DOI10.1007/S10589-024-00596-2MaRDI QIDQ6624429FDOQ6624429

Authors: C. W. Royer, L. N. Vicente 

Publication date: 25 October 2024

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Recommendations

• A derivative-free algorithm for bound constrained optimization
• Objective-derivative-free methods for constrained optimization
• Derivative-free optimization methods
• A DIRECT-type approach for derivative-free constrained global optimization
• On the numerical performance of finite-difference-based methods for derivative-free optimization

zbMATH Keywords

derivative-free optimizationlinear constraintsbound constraintsfeasible methods

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Title not available (Why is that?)
• Benchmarking optimization software with performance profiles.
• A Family of Variable-Metric Methods Derived by Variational Means
• A new approach to variable metric algorithms
• Conditioning of Quasi-Newton Methods for Function Minimization
• Optimization and nonsmooth analysis
• Trust Region Methods
• Pattern Search Algorithms for Bound Constrained Minimization
• Global convergence of general derivative-free trust-region algorithms to first- and second-order critical points
• A progressive barrier for derivative-free nonlinear programming
• Mesh Adaptive Direct Search Algorithms for Constrained Optimization
• The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
• On the Convergence of Pattern Search Algorithms
• Introduction to Derivative-Free Optimization
• Title not available (Why is that?)
• Benchmarking Derivative-Free Optimization Algorithms
• Implementing Generating Set Search Methods for Linearly Constrained Minimization
• Pattern Search Methods for Linearly Constrained Minimization
• Derivative-free optimization: a review of algorithms and comparison of software implementations
• An active-set trust-region method for derivative-free nonlinear bound-constrained optimization
• Analysis of direct searches for discontinuous functions
• Analysis of Generalized Pattern Searches
• Stationarity Results for Generating Set Search for Linearly Constrained Optimization
• Frames and Grids in Unconstrained and Linearly Constrained Optimization: A Nonsmooth Approach
• A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
• Title not available (Why is that?)
• Derivative-Free Optimization of Noisy Functions via Quasi-Newton Methods
• Nonlinear programming
• Derivative-free and blackbox optimization
• On the Convergence to Stationary Points of Deterministic and Randomized Feasible Descent Directions Methods
• Derivative-free optimization methods
• Direct search based on probabilistic feasible descent for bound and linearly constrained problems
• Two decades of blackbox optimization applications
• On the numerical performance of finite-difference-based methods for derivative-free optimization
• Full-low evaluation methods for derivative-free optimization
• Double description method revisited
• A taxonomy of constraints in black-box simulation-based optimization

This page was built for publication: Full-low evaluation methods for bound and linearly constrained derivative-free optimization

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