A modified Nelder-Mead barrier method for constrained optimization
type: Item
instance of: scholarly article
title: A modified Nelder-Mead barrier method for constrained optimization
zbMATH Open document ID: 1476.65102
author: Yanyan Li
published in: Numerical Algebra, Control and Optimization
publication date: 2021-12-27T00:00:00Z
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 7450952
zbMATH Keywords: derivative free
zbMATH Keywords: positive basis
zbMATH Keywords: convergence analysis
zbMATH Keywords: frames
zbMATH Keywords: direct search
zbMATH Keywords: numerical results
MaRDI profile type: Publication
full work available at URL: naco.2020058
OpenAlex ID: W3111481158
cites work: Analysis of Generalized Pattern Searches
cites work: Mesh Adaptive Direct Search Algorithms for Constrained Optimization
cites work: A Progressive Barrier for Derivative-Free Nonlinear Programming
cites work: OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions
cites work: Q3996569
cites work: Frame based methods for unconstrained optimization
cites work: On the convergence of grid-based methods for unconstrained optimization
cites work: Positive bases in numerical optimization
cites work: Theory of Positive Linear Dependence
cites work: Q5588268
cites work: Implementing the Nelder-Mead simplex algorithm with adaptive parameters
cites work: Test examples for nonlinear programming codes
cites work: Detection and Remediation of Stagnation in the Nelder--Mead Algorithm Using a Sufficient Decrease Condition
cites work: Q4435425
cites work: Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
cites work: Convergence of the restricted Nelder-Mead algorithm in two dimensions
cites work: Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point
cites work: Testing Unconstrained Optimization Software
cites work: Gilding the lily: A variant of the Nelder-Mead algorithm based on Golden-section search
cites work: A Simplex Method for Function Minimization
cites work: Q4215359
cites work: Frames and Grids in Unconstrained and Linearly Constrained Optimization: A Nonsmooth Approach
cites work: A convergent variant of the Nelder--Mead algorithm
cites work: On the Convergence of Pattern Search Algorithms
cites work: Fortified-Descent Simplicial Search Method: A General Approach
cites work: Q4878831
cites work: Q3947453
DOI: 10.3934/NACO.2020058
description: scientific article; zbMATH DE number 7450952