Positive bases in numerical optimization
From MaRDI portal
Publication:5960306
DOI10.1023/A:1013760716801zbMath0988.90036OpenAlexW1534239783MaRDI QIDQ5960306
Publication date: 15 April 2002
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1013760716801
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical differentiation (65D25)
Related Items (13)
On the properties of positive spanning sets and positive bases ⋮ On the cardinality of positively linearly independent sets ⋮ 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 ⋮ A short proof on the cardinality of maximal positive bases ⋮ Nicely structured positive bases with maximal cosine measure ⋮ Frame-based ray search algorithms in unconstrained 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 ⋮ A modified Nelder-Mead barrier method for constrained optimization ⋮ On sequential and parallel non-monotone derivative-free algorithms for box constrained optimization
This page was built for publication: Positive bases in numerical optimization
