OrthoMADS

swMATH7713MaRDI QIDQ19730FDOQ19730

Author name not available (Why is that?)

Official website: http://www.caam.rice.edu/caam/trs/2008/TR08-03.pdf

Cited In (76)

• Escaping local minima with local derivative-free methods: a numerical investigation
• Derivative free methodologies for circuit worst case analysis
• Snow water equivalent estimation using blackbox optimization
• Use of a biobjective direct search algorithm in the process design of material science applications
• Optimization of stochastic blackboxes with adaptive precision
• Direct search nonsmooth constrained optimization via rounded ℓ₁ penalty functions
• Automated identification system of conditions for homogeneous and heterogeneous reactions in multipurpose optimization problems
• Mesh adaptive direct search with simplicial Hessian update
• Constrained stochastic blackbox optimization using a progressive barrier and probabilistic estimates
• Model-based derivative-free methods for convex-constrained optimization
• Parallelized hybrid optimization methods for nonsmooth problems using NOMAD and linesearch
• Nonasymptotic densities for shape reconstruction
• Semiconductor device design using the \textsc{BiMADS} algorithm
• A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints
• Efficient use of parallelism in algorithmic parameter optimization applications
• A nonderivative version of the gradient sampling algorithm for nonsmooth nonconvex optimization
• Binary, unrelaxable and hidden constraints in blackbox optimization
• 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
• MultiGLODS
• An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables
• A derivative-free exact penalty algorithm: basic ideas, convergence theory and computational studies
• Review and comparison of algorithms and software for mixed-integer derivative-free optimization
• OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions
• Robust optimization of noisy blackbox problems using the mesh adaptive direct search algorithm
• Direct search methods on reductive homogeneous spaces
• A derivative-free \(\mathcal{V} \mathcal{U}\)-algorithm for convex finite-max problems
• A variance-based method to rank input variables of the mesh adaptive direct search algorithm
• DMulti-MADS: mesh adaptive direct multisearch for bound-constrained blackbox multiobjective optimization
• Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints
• A progressive barrier for derivative-free nonlinear programming
• A note on diameters of point sets
• Delaunay-based derivative-free optimization via global surrogates. III: nonconvex constraints
• Derivative-free methods for mixed-integer nonsmooth constrained optimization
• Stochastic mesh adaptive direct search for blackbox optimization using probabilistic estimates
• Linear equalities in blackbox optimization
• Use of quadratic models with mesh-adaptive direct search for constrained black box optimization
• A deterministic algorithm to compute the cosine measure of a finite positive spanning set
• Uniform simplex of an arbitrary orientation
• The mesh adaptive direct search algorithm for periodic variables
• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
• A mesh adaptive direct search algorithm for multiobjective optimization
• Order-based error for managing ensembles of surrogates in mesh adaptive direct search
• An efficient class of direct search surrogate methods for solving expensive optimization problems with CPU-time-related functions
• PSwarm
• SNOBFIT
• Using a derivative-free optimization method for multiple solutions of inverse transport problems
• Quantifying uncertainty with ensembles of surrogates for blackbox optimization
• SO-I
• LINCOA
• Equal angle distribution of polling directions in direct-search methods
• Implementation of Cartesian grids to accelerate Delaunay-based derivative-free optimization
• ASTRO-DF
• Dynamic improvements of static surrogates in direct search optimization
• On the properties of positive spanning sets and positive bases
• A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations
• Mesh adaptive direct search with second directional derivative-based Hessian update
• New horizons in sphere-packing theory, part II: Lattice-based derivative-free optimization via global surrogates
• Dynamic scaling in the mesh adaptive direct search algorithm for blackbox optimization
• A risk-averse stochastic program for integrated system design and preventive maintenance planning
• A method for stochastic constrained optimization using derivative-free surrogate pattern search and collocation
• Globalization strategies for mesh adaptive direct search
• Algorithm 1027: NOMAD Version 4: Nonlinear Optimization with the MADS Algorithm
• Constrained optimization of an idealized Y-shaped baffle for the Fontan surgery at rest and exercise
• HyperNOMAD
• A direct search quasi-Newton method for nonsmooth unconstrained optimization
• A mesh adaptive basin hopping method for the design of circular antenna arrays
• Surrogate Optimization of Computationally Expensive Black-Box Problems with Hidden Constraints
• Multi-fidelity shape optimization of hydraulic turbine runner blades using a multi-objective mesh adaptive direct search algorithm
• Global optimization of general constrained grey-box models: new method and its application to constrained PDEs for pressure swing adsorption
• Sequential penalty derivative-free methods for nonlinear constrained optimization
• Mathematical modeling and optimal blank generation in glass manufacturing
• Using QR decomposition to obtain a new instance of mesh adaptive direct search with uniformly distributed polling directions
• Derivative-free optimization methods
• Derivative-free optimization: a review of algorithms and comparison of software implementations
• Global Linear Convergence of Evolution Strategies on More than Smooth Strongly Convex Functions

This page was built for software: OrthoMADS