Full-low evaluation methods for bound and linearly constrained derivative-free optimization
type: Item
instance of: scholarly article
title: Full-low evaluation methods for bound and linearly constrained derivative-free optimization
author: C. W. Royer
author: Q6373720
author: L. N. Vicente
published in: Computational Optimization and Applications
publication date: 2024-10-25T00:00:00Z
Mathematics Subject Classification ID: 90Cxx
zbMATH DE Number: 7932031
zbMATH Keywords: derivative-free optimization
zbMATH Keywords: bound constraints
zbMATH Keywords: linear constraints
zbMATH Keywords: feasible methods
MaRDI profile type: MaRDI publication profile
cites work: Two decades of blackbox optimization applications
cites work: A Progressive Barrier for Derivative-Free Nonlinear Programming
cites work: Derivative-Free and Blackbox Optimization
cites work: Analysis of Generalized Pattern Searches
cites work: Mesh Adaptive Direct Search Algorithms for Constrained Optimization
cites work: On the Convergence to Stationary Points of Deterministic and Randomized Feasible Descent Directions Methods
cites work: Derivative-Free Optimization of Noisy Functions via Quasi-Newton Methods
cites work: Full-low evaluation methods for derivative-free optimization
cites work: Nonlinear programming
cites work: The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
cites work: Optimization and nonsmooth analysis
cites work: Trust Region Methods
cites work: Global Convergence of General Derivative-Free Trust-Region Algorithms to First- and Second-Order Critical Points
cites work: Introduction to Derivative-Free Optimization
cites work: Benchmarking optimization software with performance profiles.
cites work: A new approach to variable metric algorithms
cites work: Double description method revisited
cites work: A Family of Variable-Metric Methods Derived by Variational Means
cites work: An active-set trust-region method for derivative-free nonlinear bound-constrained optimization
cites work: Direct search based on probabilistic feasible descent for bound and linearly constrained problems
cites work: Q4312906
cites work: Q4435425
cites work: Stationarity Results for Generating Set Search for Linearly Constrained Optimization
cites work: Derivative-free optimization methods
cites work: A taxonomy of constraints in black-box simulation-based optimization
cites work: Pattern Search Algorithms for Bound Constrained Minimization
cites work: Pattern Search Methods for Linearly Constrained Minimization
cites work: Implementing Generating Set Search Methods for Linearly Constrained Minimization
cites work: A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
cites work: Benchmarking Derivative-Free Optimization Algorithms
cites work: Q5491447
cites work: Frames and Grids in Unconstrained and Linearly Constrained Optimization: A Nonsmooth Approach
cites work: Derivative-free optimization: a review of algorithms and comparison of software implementations
cites work: Conditioning of Quasi-Newton Methods for Function Minimization
cites work: On the numerical performance of finite-difference-based methods for derivative-free optimization
cites work: On the Convergence of Pattern Search Algorithms
cites work: Analysis of direct searches for discontinuous functions
DOI: 10.1007/S10589-024-00596-2
description: scientific article; zbMATH DE number 7932031