Generalized pattern search methods for a class of nonsmooth optimization problems with structure
From MaRDI portal
Publication:1023336
DOI10.1016/j.cam.2008.10.047zbMath1166.65028OpenAlexW2091291136MaRDI QIDQ1023336
C. Bogani, Alessandra Papini, Maria Grazia Gasparo
Publication date: 11 June 2009
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2008.10.047
convergencenonsmooth optimizationiterationnumerical experimentslinear constraintsgeneralized pattern searchClarke's differential calculus
Related Items (7)
Identification and control of delayed unstable and integrative LTI MIMO systems using pattern search methods ⋮ Identification and control of delayed SISO systems through pattern search methods ⋮ Genetic pattern search and its application to brain image classification ⋮ Generalized pattern search methods for control of stable, unstable and integrating systems with unknown delay under step input ⋮ Hysteresis-based switching observers for linear systems using quadratic boundedness ⋮ Derivative-free optimization methods ⋮ Random perturbation of the projected variable metric method for nonsmooth nonconvex optimization problems with linear constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Test examples for nonlinear programming codes
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- An algorithm for nonlinear optimization using linear programming and equality constrained subproblems
- Reverse search for enumeration
- Methods of descent for nondifferentiable optimization
- Pattern search method for discrete \(L_{1}\)-approximation
- Thevenin decomposition and large-scale optimization
- Convergence results for generalized pattern search algorithms are tight
- On the Convergence of Pattern Search Algorithms
- Pattern search in the presence of degenerate linear constraints
- Implementing Generating Set Search Methods for Linearly Constrained Minimization
- On the Convergence of the Multidirectional Search Algorithm
- Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point
- Analysis of Generalized Pattern Searches
- Frames and Grids in Unconstrained and Linearly Constrained Optimization: A Nonsmooth Approach
- Pattern Search Methods for Linearly Constrained Minimization
- Pattern Search Algorithms for Bound Constrained Minimization
- Convex Analysis
This page was built for publication: Generalized pattern search methods for a class of nonsmooth optimization problems with structure
