A Progressive Barrier for Derivative-Free Nonlinear Programming
From MaRDI portal
Publication:5189567
DOI10.1137/070692662zbMath1187.90266OpenAlexW2024948279MaRDI QIDQ5189567
Charles Audet, John E. jun. Dennis
Publication date: 17 March 2010
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/4c002692649dcd1aa0df4f593b2312931ecc4e4e
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56) Nonsmooth analysis (49J52)
Related Items (79)
Constrained problem formulations for power optimization of aircraft electro-thermal anti-icing systems ⋮ Use of a biobjective direct search algorithm in the process design of material science applications ⋮ Optimization with hidden constraints and embedded Monte Carlo computations ⋮ Dynamic scaling in the mesh adaptive direct search algorithm for blackbox optimization ⋮ Surrogate‐based methods for black‐box optimization ⋮ A progressive barrier derivative-free trust-region algorithm for constrained optimization ⋮ Mesh-based Nelder-Mead algorithm for inequality constrained optimization ⋮ Modeling and optimization of an ammonia reactor using a penalty-like method ⋮ Direct search nonsmooth constrained optimization via rounded ℓ1 penalty functions ⋮ A Smoothing Direct Search Method for Monte Carlo-Based Bound Constrained Composite Nonsmooth Optimization ⋮ Derivative-free methods for mixed-integer nonsmooth constrained optimization ⋮ Accelerated random search for constrained global optimization assisted by radial basis function surrogates ⋮ Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ Robust optimization of noisy blackbox problems using the mesh adaptive direct search algorithm ⋮ Constrained derivative-free optimization on thin domains ⋮ Derivative-free optimization: a review of algorithms and comparison of software implementations ⋮ Quantifying uncertainty with ensembles of surrogates for blackbox optimization ⋮ A subclass of generating set search with convergence to second-order stationary points ⋮ Optimization of black-box problems using Smolyak grids and polynomial approximations ⋮ Binary, unrelaxable and hidden constraints in blackbox optimization ⋮ GOSAC: global optimization with surrogate approximation of constraints ⋮ Globally convergent evolution strategies for constrained optimization ⋮ Escaping Unknown Discontinuous Regions in Blackbox Optimization ⋮ Implementation of Cartesian grids to accelerate Delaunay-based derivative-free optimization ⋮ Direct search based on probabilistic feasible descent for bound and linearly constrained problems ⋮ Applying the pattern search implicit filtering algorithm for solving a noisy problem of parameter identification ⋮ TREGO: a trust-region framework for efficient global optimization ⋮ Equal angle distribution of polling directions in direct-search methods ⋮ A merit function approach for evolution strategies ⋮ Two decades of blackbox optimization applications ⋮ Efficient use of parallelism in algorithmic parameter optimization applications ⋮ A general mathematical framework for constrained mixed-variable blackbox optimization problems with meta and categorical variables ⋮ Constrained stochastic blackbox optimization using a progressive barrier and probabilistic estimates ⋮ Mesh adaptive direct search with second directional derivative-based Hessian update ⋮ Modeling approaches for addressing unrelaxable bound constraints with unconstrained optimization methods ⋮ Order-based error for managing ensembles of surrogates in mesh adaptive direct search ⋮ A DIRECT SEARCH QUASI-NEWTON METHOD FOR NONSMOOTH UNCONSTRAINED OPTIMIZATION ⋮ A pattern search and implicit filtering algorithm for solving linearly constrained minimization problems with noisy objective functions ⋮ A concurrent implementation of the surrogate management framework with application to cardiovascular shape optimization ⋮ Surrogate Optimization of Computationally Expensive Black-Box Problems with Hidden Constraints ⋮ A variance-based method to rank input variables of the mesh adaptive direct search algorithm ⋮ The Mesh Adaptive Direct Search Algorithm for Granular and Discrete Variables ⋮ Optimization of algorithms with OPAL ⋮ Combining cross-entropy and MADS methods for inequality constrained global optimization ⋮ Black-Box Optimization: Methods and Applications ⋮ Global optimization of general constrained grey-box models: new method and its application to constrained PDEs for pressure swing adsorption ⋮ Direct search methods on reductive homogeneous spaces ⋮ Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm ⋮ Use of quadratic models with mesh-adaptive direct search for constrained black box optimization ⋮ A method for stochastic constrained optimization using derivative-free surrogate pattern search and collocation ⋮ Globalization strategies for mesh adaptive direct search ⋮ Hypersonic flight vehicle trajectory optimization using pattern search algorithm ⋮ Locally weighted regression models for surrogate-assisted design optimization ⋮ Mesh adaptive direct search with simplicial Hessian update ⋮ Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints ⋮ Trade-off studies in blackbox optimization ⋮ A sequential quadratic programming algorithm for equality-constrained optimization without derivatives ⋮ A trust-region-based derivative free algorithm for mixed integer programming ⋮ Multi-fidelity shape optimization of hydraulic turbine runner blades using a multi-objective mesh adaptive direct search algorithm ⋮ DMulti-MADS: mesh adaptive direct multisearch for bound-constrained blackbox multiobjective optimization ⋮ A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints ⋮ Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming ⋮ Derivative-free superiorization: principle and algorithm ⋮ Monotonic grey box direct search optimization ⋮ Derivative-Free Feasible Backtracking Search Methods for Nonlinear Multiobjective Optimization with Simple Boundary Constraint ⋮ A modified Nelder-Mead barrier method for constrained optimization ⋮ Derivative-free optimization methods ⋮ Hierarchically constrained blackbox optimization ⋮ Derivative free methodologies for circuit worst case analysis ⋮ Delaunay-based derivative-free optimization via global surrogates. III: nonconvex constraints ⋮ Mathematical modeling and optimal blank generation in glass manufacturing ⋮ Linear equalities in blackbox optimization ⋮ On sequential and parallel non-monotone derivative-free algorithms for box constrained optimization ⋮ Optimization of Stochastic Blackboxes with Adaptive Precision ⋮ GLODS: global and local optimization using direct search ⋮ CONORBIT: constrained optimization by radial basis function interpolation in trust regions ⋮ Optimality properties of an augmented Lagrangian method on infeasible problems ⋮ A derivative-free exact penalty algorithm: basic ideas, convergence theory and computational studies ⋮ Analysis of multi-objective Kriging-based methods for constrained global optimization
Uses Software
This page was built for publication: A Progressive Barrier for Derivative-Free Nonlinear Programming
