Cutting Plane Algorithms and Approximate Lower Subdifferentiability
Jean-Paul Penot () and
Pham Hong Quang
Additional contact information
Jean-Paul Penot: Université de Pau
Pham Hong Quang: NCSR of Vietnam
Journal of Optimization Theory and Applications, 2011, vol. 148, issue 3, No 2, 455-470
Abstract:
Abstract A notion of boundedly ε-lower subdifferentiable functions is introduced and investigated. It is shown that a bounded from below, continuous, quasiconvex function is locally boundedly ε-lower subdifferentiable for every ε>0. Some algorithms of cutting plane type are constructed to solve minimization problems with approximately lower subdifferentiable objective and constraints. In those algorithms an approximate minimizer on a compact set is obtained in a finite number of iterations provided some boundedness assumption be satisfied.
Keywords: Approximate minimization; Cutting plane method; ε-lower subgradient; Lower subdifferential; Nonsmooth optimization; Quasiconvex function (search for similar items in EconPapers)
Date: 2011
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
http://link.springer.com/10.1007/s10957-010-9762-6 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:148:y:2011:i:3:d:10.1007_s10957-010-9762-6
Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2
DOI: 10.1007/s10957-010-9762-6
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 ().