Linear equalities in blackbox optimization
From MaRDI portal
Publication:2340487
DOI10.1007/S10589-014-9708-2zbMATH Open1311.90185DBLPjournals/coap/AudetDP15OpenAlexW2098024031WikidataQ58201030 ScholiaQ58201030MaRDI QIDQ2340487FDOQ2340487
Authors: Charles Audet, Sébastien Le Digabel, Mathilde Peyrega 
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
Recommendations
- Dynamic scaling in the mesh adaptive direct search algorithm for blackbox optimization
- Mesh adaptive direct search with second directional derivative-based Hessian update
- Globalization strategies for mesh adaptive direct search
- The mesh adaptive direct search algorithm for periodic variables
- A variance-based method to rank input variables of the mesh adaptive direct search algorithm
convergence analysisderivative-free optimizationblackbox optimizationlinear equality constraintsMads
Cites Work
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Numerical Optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- Optimization and nonsmooth analysis
- Algorithm 909: NOMAD: nonlinear optimization with the MADS algorithm
- A progressive barrier for derivative-free nonlinear programming
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- Nonlinear programming without a penalty function or a filter
- Test examples for nonlinear programming codes
- 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
- On selecting a maximum volume sub-matrix of a matrix and related problems
- Pattern Search Methods for Linearly Constrained Minimization
- Constrained derivative-free optimization on thin domains
- Reducing the number of function evaluations in mesh adaptive direct search algorithms
- OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions
- Stationarity Results for Generating Set Search for Linearly Constrained Optimization
- Frames and Grids in Unconstrained and Linearly Constrained Optimization: A Nonsmooth Approach
- Inexact restoration method for derivative-free optimization with smooth constraints
- Generalized pattern search methods for linearly equality constrained optimization problems
- A survey on direct search methods for blackbox optimization and their applications
- Pattern search in the presence of degenerate linear constraints
- On the convergence of grid-based methods for unconstrained optimization
- Title not available (Why is that?)
- Active set identification for linearly constrained minimization without explicit derivatives
- A derivative-free trust-funnel method for equality-constrained nonlinear optimization
- A superlinearly convergent algorithm for minimization without evaluating derivatives
- 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
Cited In (14)
- Binary, unrelaxable and hidden constraints in blackbox optimization
- DEFT-FUNNEL: an open-source global optimization solver for constrained grey-box and black-box problems
- A progressive barrier derivative-free trust-region algorithm for constrained optimization
- Non-monotone derivative-free algorithm for solving optimization models with linear constraints: extensions for solving nonlinearly constrained models via exact penalty methods
- Direct search methods on reductive homogeneous spaces
- Two decades of blackbox optimization applications
- Best practices for comparing optimization algorithms
- Direct search based on probabilistic feasible descent for bound and linearly constrained problems
- Mesh adaptive direct search with second directional derivative-based Hessian update
- Dynamic scaling in the mesh adaptive direct search algorithm for blackbox optimization
- Direct search nonsmooth constrained optimization via rounded ℓ1 penalty functions
- Retraction-based direct search methods for derivative free Riemannian optimization
- A derivative-free algorithm for non-linear optimization with linear equality constraints
- Derivative-free optimization methods
Uses Software
This page was built for publication: Linear equalities in blackbox optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2340487)
