Minimizing and Stationary Sequences of Convex Constrained Minimization Problems

Y. R. He
Additional contact information
Y. R. He: Chinese University of Hong Kong

Journal of Optimization Theory and Applications, 2001, vol. 111, issue 1, No 7, 137-153

Abstract: Abstract In the asymptotic analysis of the minimization problem for a nonsmooth convex function on a closed convex set X in ℝn, one can consider the corresponding problem of minimizing a smooth convex function F on ℝn, where F denotes the Moreau–Yosida regularization of f. We study the interrelationship between the minimizing/stationary sequence for f and that for F. An algorithm is given to generate iteratively a possibly unbounded sequence, which is shown to be a minimizing sequence of f under certain regularity and uniform continuity assumptions.

Keywords: Constrained minimization problems; convexity; metrical regularity; minimizing sequences; Moreau–Yosida regularization; stationary sequences (search for similar items in EconPapers)
Date: 2001
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1023/A:1017575415432 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:111:y:2001:i:1:d:10.1023_a:1017575415432

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1023/A:1017575415432

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().