Stationarity results for generating set search for linearly constrained optimization.
- College of William & Mary, Williamsburg, VA
We derive new stationarity results for derivative-free, generating set search methods for linearly constrained optimization. We show that a particular measure of stationarity is of the same order as the step length at an identifiable subset of the iterations. Thus, even in the absence of explicit knowledge of the derivatives of the objective function, we still have information about stationarity. These results help both unify the convergence analysis of several classes of direct search algorithms and clarify the fundamental geometrical ideas that underlie them. In addition, these results validate a practical stopping criterion for such algorithms.
- Research Organization:
- Sandia National Laboratories (SNL), Albuquerque, NM, and Livermore, CA (United States)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- AC04-94AL85000
- OSTI ID:
- 918255
- Report Number(s):
- SAND2003-8550; TRN: US200818%%172
- Country of Publication:
- United States
- Language:
- English
Similar Records
A generating set direct search augmented Lagrangian algorithm for optimization with a combination of general and linear constraints.
Asynchronous parallel generating set search for linearly-constrained optimization.
Asynchronous parallel generating set search for linearly-constrained optimization.
Technical Report
·
Tue Aug 01 00:00:00 EDT 2006
·
OSTI ID:893121
Asynchronous parallel generating set search for linearly-constrained optimization.
Technical Report
·
Sun Apr 01 00:00:00 EDT 2007
·
OSTI ID:1139970
Asynchronous parallel generating set search for linearly-constrained optimization.
Technical Report
·
Tue Aug 01 00:00:00 EDT 2006
·
OSTI ID:891372