Generalized pattern search methods for a class of nonsmooth optimization problems with structure
type: Item
instance of: scholarly article
title: Generalized pattern search methods for a class of nonsmooth optimization problems with structure
zbMATH Open document ID: 1166.65028
author: C. Bogani
author: M. G. Gasparo
author: Alessandra Papini
published in: Journal of Computational and Applied Mathematics
publication date: 2009-06-11T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 5564266
zbMATH Keywords: generalized pattern search
zbMATH Keywords: nonsmooth optimization
zbMATH Keywords: linear constraints
zbMATH Keywords: Clarke's differential calculus
zbMATH Keywords: iteration
zbMATH Keywords: convergence
zbMATH Keywords: numerical experiments
MaRDI profile type: Publication
full work available at URL: j.cam.2008.10.047
OpenAlex ID: W2091291136
cites work: Pattern search in the presence of degenerate linear constraints
cites work: Convergence results for generalized pattern search algorithms are tight
cites work: Analysis of Generalized Pattern Searches
cites work: A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
cites work: Reverse search for enumeration
cites work: Thevenin decomposition and large-scale optimization
cites work: An algorithm for nonlinear optimization using linear programming and equality constrained subproblems
cites work: Pattern search method for discrete \(L_{1}\)-approximation
cites work: Q4821526
cites work: Q4000274
cites work: Q4226179
cites work: Test examples for nonlinear programming codes
cites work: Methods of descent for nondifferentiable optimization
cites work: Q4435425
cites work: Implementing Generating Set Search Methods for Linearly Constrained Minimization
cites work: Pattern Search Algorithms for Bound Constrained Minimization
cites work: Pattern Search Methods for Linearly Constrained Minimization
cites work: Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point
cites work: Frames and Grids in Unconstrained and Linearly Constrained Optimization: A Nonsmooth Approach
cites work: Convex Analysis
cites work: On the Convergence of the Multidirectional Search Algorithm
cites work: On the Convergence of Pattern Search Algorithms
DOI: 10.1016/J.CAM.2008.10.047
Recommended article: Generalized pattern search methods for linearly equality constrained optimization problems
Recommended article: Exploiting problem structure in pattern search methods for unconstrained optimization
Recommended article: Pattern Search Methods for Linearly Constrained Minimization
Recommended article: A Pattern Search Filter Method for Nonlinear Programming without Derivatives
Recommended article: An efficient approach to a class of non-smooth optimization problems
Recommended article: Q3982459
Recommended article: General form of nonmonotone line search techniques for unconstrained optimization
Recommended article: Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
Recommended article: Pattern Search Algorithms for Bound Constrained Minimization
Recommended article: Generalized uniformly optimal methods for nonlinear programming
description: scientific article; zbMATH DE number 5564266