Positive Bases in Numerical Optimization

Authors:
I. D. Coope;C. J. Price
Affiliations:
Department of Mathematics and Statistics, University of Canterbury, Private Bag 4800, Christchurch, New Zealand;Department of Mathematics and Statistics, University of Canterbury, Private Bag 4800, Christchurch, New Zealand
Venue:
Computational Optimization and Applications
Year:
2002

Citing 6
Cited 4

`` Direct Search'' Solution of Numerical and Statistical Problems

Journal of the ACM (JACM)
Testing Unconstrained Optimization Software

ACM Transactions on Mathematical Software (TOMS)
Frame based methods for unconstrained optimization

Journal of Optimization Theory and Applications
On the Convergence of Grid-Based Methods for Unconstrained Optimization

SIAM Journal on Optimization
Pattern Search Algorithms for Bound Constrained Minimization

SIAM Journal on Optimization
RANK ORDERING AND POSITIVE BASES IN PATTERN SEARCH ALGORITHMS

RANK ORDERING AND POSITIVE BASES IN PATTERN SEARCH ALGORITHMS

Conjugate Grids for Unconstrained Optimisation

Computational Optimization and Applications
A new quasi-Newton pattern search method based on symmetric rank-one update for unconstrained optimization

Computers & Mathematics with Applications
Combined heat and power economic dispatch by mesh adaptive direct search algorithm

Expert Systems with Applications: An International Journal
Two minimal positive bases based direct search conjugate gradient methods for computationally expensive functions

Numerical Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

The theory of positive bases introduced by C. Davis in 1954 does not appear in most modern texts on linear algebra but has re-emerged in publications in optimization journals. In this paper some simple properties of this highly useful theory are highlighted and applied to both theoretical and practical aspects of the design and implementation of numerical algorithms for nonlinear optimization.