Linear equalities in blackbox optimization
From MaRDI portal
Publication:2340487
DOI10.1007/s10589-014-9708-2zbMath1311.90185OpenAlexW2098024031WikidataQ58201030 ScholiaQ58201030MaRDI QIDQ2340487
Charles Audet, Mathilde Peyrega, Sébastien Le Digabel
Publication date: 20 April 2015
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-014-9708-2
convergence analysisderivative-free optimizationlinear equality constraintsblackbox optimizationMads
Related Items
A progressive barrier derivative-free trust-region algorithm for constrained optimization, Direct search nonsmooth constrained optimization via rounded ℓ1 penalty functions, Non-monotone derivative-free algorithm for solving optimization models with linear constraints: extensions for solving nonlinearly constrained models via exact penalty methods, Best practices for comparing optimization algorithms, Direct search based on probabilistic feasible descent for bound and linearly constrained problems, Two decades of blackbox optimization applications, A derivative-free algorithm for non-linear optimization with linear equality constraints, DEFT-FUNNEL: an open-source global optimization solver for constrained grey-box and black-box problems, Direct search methods on reductive homogeneous spaces, Derivative-free optimization methods
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonlinear programming without a penalty function or a filter
- Generalized pattern search methods for linearly equality constrained optimization problems
- On selecting a maximum volume sub-matrix of a matrix and related problems
- Test examples for nonlinear programming codes
- A derivative-free trust-funnel method for equality-constrained nonlinear optimization
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Constrained derivative-free optimization on thin domains
- On the Convergence of Grid-Based Methods for Unconstrained Optimization
- Inexact Restoration Method for Derivative-Free Optimization with Smooth Constraints
- Algorithm 909
- On the Convergence of Pattern Search Algorithms
- Reducing the Number of Function Evaluations in Mesh Adaptive Direct Search Algorithms
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- Pattern search in the presence of degenerate linear constraints
- Implementing Generating Set Search Methods for Linearly Constrained Minimization
- OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions
- Active Set Identification for Linearly Constrained Minimization Without Explicit Derivatives
- Introduction to Derivative-Free Optimization
- Optimization and nonsmooth analysis
- A superlinearly convergent algorithm for minimization without evaluating derivatives
- Numerical Optimization
- Frames and Grids in Unconstrained and Linearly Constrained Optimization: A Nonsmooth Approach
- Pattern Search Methods for Linearly Constrained Minimization
- A Survey on Direct Search Methods for Blackbox Optimization and Their Applications
- Benchmarking Derivative-Free Optimization Algorithms
- A Progressive Barrier for Derivative-Free Nonlinear Programming
- Asynchronous Parallel Generating Set Search for Linearly Constrained Optimization
- Spherical Mesh Adaptive Direct Search for Separating Quasi-Uncorrelated Sources by Range-Based Independent Component Analysis
- Stationarity Results for Generating Set Search for Linearly Constrained Optimization
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
