OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions
From MaRDI portal
Recommendations
- On orthogonal circulant MDS matrices
- Orthogonal MDS diffusion matrices over Galois rings
- Orthogonal arryas and their applications
- scientific article; zbMATH DE number 782062
- A fast randomized algorithm for orthogonal projection
- The orthogonal flows for orthogonal iteration
- A new route toward orthogonality
- scientific article; zbMATH DE number 17928
- The Orthogonal qd-Algorithm
- An iterational method for vector orthogonalization
Cited in
(83)- Robust optimization of noisy blackbox problems using the mesh adaptive direct search algorithm
- Implementation of Cartesian grids to accelerate Delaunay-based derivative-free optimization
- Order-based error for managing ensembles of surrogates in mesh adaptive direct search
- Nonasymptotic densities for shape reconstruction
- Direct search methods on reductive homogeneous spaces
- A mesh adaptive basin hopping method for the design of circular antenna arrays
- Efficient use of parallelism in algorithmic parameter optimization applications
- New horizons in sphere-packing theory, part II: Lattice-based derivative-free optimization via global surrogates
- Parallelized hybrid optimization methods for nonsmooth problems using NOMAD and linesearch
- Stochastic mesh adaptive direct search for blackbox optimization using probabilistic estimates
- DMulti-MADS: mesh adaptive direct multisearch for bound-constrained blackbox multiobjective optimization
- A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints
- A modified Nelder-Mead barrier method for constrained optimization
- Review and comparison of algorithms and software for mixed-integer derivative-free optimization
- A derivative-free exact penalty algorithm: basic ideas, convergence theory and computational studies
- Derivative-free methods for mixed-integer nonsmooth constrained optimization
- Quantifying uncertainty with ensembles of surrogates for blackbox optimization
- A deterministic algorithm to compute the cosine measure of a finite positive spanning set
- Uniform simplex of an arbitrary orientation
- A concurrent implementation of the surrogate management framework with application to cardiovascular shape optimization
- A local search method for costly black-box problems and its application to CSP plant start-up optimization refinement
- An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables
- A mesh adaptive direct search algorithm for multiobjective optimization
- Mesh adaptive direct search with simplicial Hessian update
- Multi-fidelity shape optimization of hydraulic turbine runner blades using a multi-objective mesh adaptive direct search algorithm
- Dynamic improvements of static surrogates in direct search optimization
- Derivative free methodologies for circuit worst case analysis
- Mathematical modeling and optimal blank generation in glass manufacturing
- Linear equalities in blackbox optimization
- Use of a biobjective direct search algorithm in the process design of material science applications
- Using a derivative-free optimization method for multiple solutions of inverse transport problems
- On the properties of positive spanning sets and positive bases
- Dynamic scaling in the mesh adaptive direct search algorithm for blackbox optimization
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- Multi-objective optimization of chemical reaction conditions based on a kinetic model
- Using QR decomposition to obtain a new instance of mesh adaptive direct search with uniformly distributed polling directions
- A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations
- Binary, unrelaxable and hidden constraints in blackbox optimization
- Constrained stochastic blackbox optimization using a progressive barrier and probabilistic estimates
- A CARTopt method for bound-constrained global optimization
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Parallel Space Decomposition of the Mesh Adaptive Direct Search Algorithm
- Convergence of Mesh Adaptive Direct Search to Second‐Order Stationary Points
- A derivative-free comirror algorithm for convex optimization
- Random derivative-free algorithm for solving unconstrained or bound constrained continuously differentiable non-linear problems
- An efficient class of direct search surrogate methods for solving expensive optimization problems with CPU-time-related functions
- Semiconductor device design using the \textsc{BiMADS} algorithm
- A variance-based method to rank input variables of the mesh adaptive direct search algorithm
- Use of quadratic models with mesh-adaptive direct search for constrained black box optimization
- Optimization of stochastic blackboxes with adaptive precision
- Direct search nonsmooth constrained optimization via rounded ℓ1 penalty functions
- Automated identification system of conditions for homogeneous and heterogeneous reactions in multipurpose optimization problems
- Model-based derivative-free methods for convex-constrained optimization
- Global optimization of general constrained grey-box models: new method and its application to constrained PDEs for pressure swing adsorption
- Global Linear Convergence of Evolution Strategies on More than Smooth Strongly Convex Functions
- Escaping local minima with local derivative-free methods: a numerical investigation
- A derivative-free \(\mathcal{V} \mathcal{U}\)-algorithm for convex finite-max problems
- Surrogate Optimization of Computationally Expensive Black-Box Problems with Hidden Constraints
- Black-Box Optimization: Methods and Applications
- Trade-off studies in blackbox optimization
- Derivative-free optimization methods
- A note on diameters of point sets
- Two decades of blackbox optimization applications
- Nicely structured positive bases with maximal cosine measure
- Convergence of derivative-free nonmonotone direct search methods for unconstrained and box-constrained mixed-integer optimization
- Constrained optimization of an idealized Y-shaped baffle for the Fontan surgery at rest and exercise
- Handling of constraints in multiobjective blackbox optimization
- Counterexample and an additional revealing poll step for a result of ``Analysis of direct searches for discontinuous functions
- A hybrid direct search and projected simplex gradient method for convex constrained minimization
- A risk-averse stochastic program for integrated system design and preventive maintenance planning
- A derivative-free approach to mixed integer constrained multiobjective nonsmooth black-box optimization
- Convergence towards a local minimum by direct search methods with a covering step
- An inexact restoration direct multisearch filter approach to multiobjective constrained derivative-free optimization
- Bi-attribute utility preference robust optimization: a continuous piecewise linear approximation approach
- A solution method for mixed-variable constrained blackbox optimization problems
- An augmented Lagrangian-based method using primitive directions for mixed-integer nonlinear problems
- Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints
- SCR, an efficient global optimization algorithm for constrained black-box problems
- Delaunay-based derivative-free optimization via global surrogates. III: nonconvex constraints
- Equal angle distribution of polling directions in direct-search methods
- Mesh adaptive direct search with second directional derivative-based Hessian update
- A method for stochastic constrained optimization using derivative-free surrogate pattern search and collocation
- Globalization strategies for mesh adaptive direct search
This page was built for publication: OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3563916)
