Year: 2004
Type: article
Abstract: Active set algorithms, such as the projected gradient method in nonlinear optimization, are designed to "identify" the active constraints of the problem in a finite number of iterations. Using the notions of "partial smoothness" and "prox-regularity" we extend work of Burke, More and Wright on identifiable surfaces from the convex case to a general nonsmooth setting. We further show how this setting can be used in the study of sufficient conditions for local minimizers.
Source: Journal of convex analysis
DOI: 10.68381/jca11017
Authors: W. L. Hare, A. S. Lewis
Institution: Simon Fraser University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W171925985
