Pages that link to "Item:Q5960306"
From MaRDI portal
The following pages link to Positive bases in numerical optimization (Q5960306):
Displayed 13 items.
- On the cardinality of positively linearly independent sets (Q276303) (← links)
- A short proof on the cardinality of maximal positive bases (Q628667) (← links)
- Two minimal positive bases based direct search conjugate gradient methods for computationally expensive functions (Q652326) (← links)
- Grid-based methods for linearly equality constrained optimization problems (Q874345) (← links)
- A new quasi-Newton pattern search method based on symmetric rank-one update for unconstrained optimization (Q931755) (← links)
- Frame-based ray search algorithms in unconstrained optimization (Q1411465) (← links)
- A modified Nelder-Mead barrier method for constrained optimization (Q2062438) (← links)
- A deterministic algorithm to compute the cosine measure of a finite positive spanning set (Q2192976) (← links)
- Uniform simplex of an arbitrary orientation (Q2192988) (← links)
- On the properties of positive spanning sets and positive bases (Q2357977) (← links)
- On sequential and parallel non-monotone derivative-free algorithms for box constrained optimization (Q2867433) (← links)
- Exploiting Problem Structure in Derivative Free Optimization (Q5066599) (← links)
- Nicely structured positive bases with maximal cosine measure (Q6164951) (← links)