Constrained derivative-free optimization on thin domains
type: Item
instance of: scholarly article
title: Constrained derivative-free optimization on thin domains
zbMATH Open document ID: 1272.90091
author: F. N. C. Sobral
author: J. M. Martínez
published in: Journal of Global Optimization
publication date: 2013-08-01T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C56
zbMATH DE Number: 6193566
zbMATH Keywords: derivative-free optimization
zbMATH Keywords: disconnected domains
zbMATH Keywords: global convergence
zbMATH Keywords: numerical experiments
zbMATH Keywords: thin domains
describes a project that uses: NOMAD
describes a project that uses: HOPSPACK
describes a project that uses: DFO
describes a project that uses: LANCELOT
describes a project that uses: BOBYQA
MaRDI profile type: Publication
full work available at URL: s10898-012-9944-x
OpenAlex ID: W2064215934
cites work: On Augmented Lagrangian Methods with General Lower-Level Constraints
cites work: A new algorithm for optimization
cites work: Mesh Adaptive Direct Search Algorithms for Constrained Optimization
cites work: A Progressive Barrier for Derivative-Free Nonlinear Programming
cites work: Globalization strategies for mesh adaptive direct search
cites work: Dynamic Control of Infeasibility in Equality Constrained Optimization
cites work: Global minimization using an augmented Lagrangian method with variable lower-level constraints
cites work: Local convergence of an inexact-restoration method and numerical experiments
cites work: Q4023146
cites work: Recent progress in unconstrained nonlinear optimization without derivatives
cites work: Benchmarking Derivative-Free Optimization Algorithms
cites work: Introduction to Derivative-Free Optimization
cites work: Using Sampling and Simplex Derivatives in Pattern Search Methods
cites work: Derivative-free methods for nonlinear programming with general lower-level constraints
cites work: Benchmarking optimization software with performance profiles.
cites work: Nonlinear programming without a penalty function or a filter
cites work: Nonlinearly Constrained Optimization Using Heuristic Penalty Methods and Asynchronous Parallel Generating Set Search
cites work: Test examples for nonlinear programming codes
cites work: Stationarity Results for Generating Set Search for Linearly Constrained Optimization
cites work: Pattern Search Algorithms for Bound Constrained Minimization
cites work: Pattern Search Methods for Linearly Constrained Minimization
cites work: A Globally Convergent Augmented Lagrangian Pattern Search Algorithm for Optimization with General Constraints and Simple Bounds
cites work: Algorithm 909
cites work: Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming.
cites work: Inexact-restoration algorithm for constrained optimization
cites work: A note on a method for generating points uniformly on n -dimensional spheres
cites work: A Simplex Method for Function Minimization
cites work: Constrained Nonlinear Optimization by Heuristic Programming
cites work: A More Portable Fortran Random Number Generator
cites work: On the Convergence of Pattern Search Algorithms
cites work: Analysis of direct searches for discontinuous functions
DOI: 10.1007/S10898-012-9944-X
description: scientific article