Pattern search in the presence of degenerate linear constraints
DOI10.1080/10556780701521670zbMATH Open1162.90588OpenAlexW2043492240MaRDI QIDQ3514838FDOQ3514838
Authors: Mark A. Abramson, Rachael L. Pingel, O. A. Brezhneva, J. E. jun. Dennis 
Publication date: 23 July 2008
Published in: Optimization Methods \& Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780701521670
Recommendations
- Pattern Search Methods for Linearly Constrained Minimization
- A pattern search filter method for linearly equality constrained optimization problems
- Generalized pattern search methods for linearly equality constrained optimization problems
- Analysis of Generalized Pattern Searches
- A Globally Convergent Augmented Lagrangian Pattern Search Algorithm for Optimization with General Constraints and Simple Bounds
degeneracylinearly constrained optimizationredundancyderivative-free optimizationpattern searchconstraint classification
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- On the Convergence of Pattern Search Algorithms
- Title not available (Why is that?)
- Reverse search for enumeration
- Implementing Generating Set Search Methods for Linearly Constrained Minimization
- A degenerate extreme point strategy for the classification of linear constraints as redundant or necessary
- Pattern Search Methods for Linearly Constrained Minimization
- Analysis of Generalized Pattern Searches
- Frames and Grids in Unconstrained and Linearly Constrained Optimization: A Nonsmooth Approach
- Redundancy in mathematical programming. A state-of-the-art survey
- Second-Order Behavior of Pattern Search
- Constraint classification in mathematical programming
- Hit-and-run algorithms for the identification of nonredundant linear inequalities
Cited In (14)
- A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints
- Generalized pattern search methods for a class of nonsmooth optimization problems with structure
- Pattern Search Methods for Linearly Constrained Minimization
- Non-monotone derivative-free algorithm for solving optimization models with linear constraints: extensions for solving nonlinearly constrained models via exact penalty methods
- Generating set search using simplex gradients for bound-constrained black-box optimization
- Linear equalities in blackbox optimization
- A pattern search and implicit filtering algorithm for solving linearly constrained minimization problems with noisy objective functions
- A degenerate extreme point strategy for the classification of linear constraints as redundant or necessary
- Direct search based on probabilistic feasible descent for bound and linearly constrained problems
- Inexact restoration method for nonlinear optimization without derivatives
- A hybrid direct search and projected simplex gradient method for convex constrained minimization
- Pattern search ranking and selection algorithms for mixed variable simulation-based optimization
- Globally convergent evolution strategies for constrained optimization
- Pattern Search Algorithms for Bound Constrained Minimization
Uses Software
This page was built for publication: Pattern search in the presence of degenerate linear constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3514838)
