DFN

swMATH36998MaRDI QIDQ52700

No author found.

Described by source

• Parallelized hybrid optimization methods for nonsmooth problems using NOMAD and linesearch
• A Linesearch-Based Derivative-Free Approach for Nonsmooth Constrained Optimization

Related Items (26)

Direct search nonsmooth constrained optimization via rounded ℓ₁ penalty functions ⋮ Asynchronously parallel optimization solver for finding multiple minima ⋮ Non-monotone derivative-free algorithm for solving optimization models with linear constraints: extensions for solving nonlinearly constrained models via exact penalty methods ⋮ Derivative-free methods for mixed-integer nonsmooth constrained optimization ⋮ A Derivative-Free Approach to Constrained Multiobjective Nonsmooth Optimization ⋮ Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ Quantifying uncertainty with ensembles of surrogates for blackbox optimization ⋮ Binary, unrelaxable and hidden constraints in blackbox optimization ⋮ Combining global and local strategies to optimize parameters in magnetic spacecraft control via attitude feedback ⋮ Applying the pattern search implicit filtering algorithm for solving a noisy problem of parameter identification ⋮ A New Sequential Optimality Condition for Constrained Nonsmooth Optimization ⋮ A pattern search and implicit filtering algorithm for solving linearly constrained minimization problems with noisy objective functions ⋮ An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables ⋮ A sharp augmented Lagrangian-based method in constrained non-convex optimization ⋮ Filter-based DIRECT method for constrained global optimization ⋮ Convergent inexact penalty decomposition methods for cardinality-constrained problems ⋮ Trust-Region Methods for the Derivative-Free Optimization of Nonsmooth Black-Box Functions ⋮ A derivative-free optimization approach for the autotuning of a forex trading strategy ⋮ A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints ⋮ Essentials of numerical nonsmooth optimization ⋮ Derivative-free optimization methods ⋮ Derivative free methodologies for circuit worst case analysis ⋮ A geometric integration approach to nonsmooth, nonconvex optimisation ⋮ A derivative-free algorithm for constrained global optimization based on exact penalty functions ⋮ Essentials of numerical nonsmooth optimization ⋮ A derivative-free exact penalty algorithm: basic ideas, convergence theory and computational studies

This page was built for software: DFN