Positive bases in numerical optimization
From MaRDI portal
Recommendations
Cited in
(14)- On sequential and parallel non-monotone derivative-free algorithms for box constrained optimization
- On the cardinality of positively linearly independent sets
- A short proof on the cardinality of maximal positive bases
- Exploiting Problem Structure in Derivative Free Optimization
- Grid-based methods for linearly equality constrained optimization problems
- A deterministic algorithm to compute the cosine measure of a finite positive spanning set
- Uniform simplex of an arbitrary orientation
- Frame-based ray search algorithms in unconstrained optimization
- Positive bases with maximal cosine measure
- On the properties of positive spanning sets and positive bases
- Nicely structured positive bases with maximal cosine measure
- A modified Nelder-Mead barrier method for constrained optimization
- Two minimal positive bases based direct search conjugate gradient methods for computationally expensive functions
- A new quasi-Newton pattern search method based on symmetric rank-one update for unconstrained optimization
This page was built for publication: Positive bases in numerical optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5960306)