Generalized weak sharp minima in cone-constrained convex optimization with applications

H. Luo, X. Huang () and J. Peng

Computational Optimization and Applications, 2012, vol. 53, issue 3, 807-821

Abstract: In this paper, we consider convex optimization problems with cone constraints (CPC in short). We study generalized weak sharp minima properties for (CPC) in the Banach space and Hilbert space settings, respectively. Some criteria and characterizations for the solution set to be a set of generalized weak sharp minima for (CPC) are derived. As an application, we propose an algorithm for (CPC) in the Hilbert space setting. Convergence analysis of this algorithm is given. Copyright Springer Science+Business Media, LLC 2012

Keywords: Cone-constrained convex programming; Generalized weak sharp minima; Robinson’s constraint qualification; Systems of differential inclusions; Tangent cone (search for similar items in EconPapers)
Date: 2012
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/s10589-012-9457-z (text/html)
Access to full text is restricted to subscribers.

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:coopap:v:53:y:2012:i:3:p:807-821

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-012-9457-z

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

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