Black-box complexity of local minimization
Loading...
No Access Until
Permanent Link(s)
Collections
Other Titles
Author(s)
Abstract
We study the complexity of local minimization in the black-box model, that is, the model in which the objective function and possibly its gradient are available as external subroutines. This is the model used, for example, in all the optimization algorithms in the 1983 book by Dennis and Schnabel. Our first main result is that the complexity grows polynomially with the number of variables n, in contrast to other related black-box problems (global minimization, Brouwer fixed points) for which the worst case complexity is exponential in n. Our second contribution is the construction of a family of functions that are bad cases for all possible black-box local optimization algorithms.
Journal / Series
Volume & Issue
Description
Sponsorship
Date Issued
1990-06
Publisher
Cornell University
Keywords
computer science; technical report
Location
Effective Date
Expiration Date
Sector
Employer
Union
Union Local
NAICS
Number of Workers
Committee Chair
Committee Co-Chair
Committee Member
Degree Discipline
Degree Name
Degree Level
Related Version
Related DOI
Related To
Related Part
Based on Related Item
Has Other Format(s)
Part of Related Item
Related To
Related Publication(s)
Link(s) to Related Publication(s)
References
Link(s) to Reference(s)
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR90-1132
Government Document
ISBN
ISMN
ISSN
Other Identifiers
Rights
Rights URI
Types
technical report