Cutting plane algorithms and approximate lower subdifferentiability
type: Item
instance of: scholarly article
title: Cutting plane algorithms and approximate lower subdifferentiability
zbMATH Open document ID: 1250.90090
author: Jean-Paul Penot
author: P. H. Quang
published in: Journal of Optimization Theory and Applications
publication date: 2011-05-11T00:00:00Z
review text: This paper introduced and investigated a notation of approximate lower subdifferentiability. It used the fact that a conjugation of the Fenchel-Moreau type can be introduced for quasiconvex functions using quasi-affine functions or the coupling functional. This paper intends to use this concept to develop cutting plane algorithms. It relaxes the compactness assumption on sublevels sets and the boundedness assumption on the lower subgradient made other paper and, more importantly, the authors allow the occurrence of some inaccuracy. In order to guarantee the convergence of the algorithm, the authors require a weak form of boundedness of approximate lower subdifferentials. In this paper, the class of boundedly approximately lower subdifferentiable functions is defined and shown to be very closely related to the class of continuous and quasiconvex functions. Approximate lower subdifferentiability is studied in which calculus rules are provided. A basic cutting plane algorithm for minimizing an lower subdifferentiable function is constructed and its convergence is discussed. Two algorithms for constrained optimization are proposed where the constraining functions are involved in the construction of cutting planes. The OCP (outer cutting plane) algorithm gives an approximate solution sufficiently close to the feasible set, but not necessarily in the feasible set. On the other hand, the ICP (inner cutting plane) algorithm generates feasible points only, but the solution just gives an approximate value of the objective function over a more restricted constraint set. When combined, these two algorithms give good enough approximate solutions.
reviewed by: Lai-Jiu Lin
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 5886726
zbMATH Keywords: approximation minization
zbMATH Keywords: cutting plane method
zbMATH Keywords: lower subdifferential
zbMATH Keywords: lower subgradient
zbMATH Keywords: nonsmooth optimization
zbMATH Keywords: quasi-convex function
MaRDI profile type: Publication
full work available at URL: s10957-010-9762-6
OpenAlex ID: W2047833292
cites work: The Cutting-Plane Method for Solving Convex Programs
cites work: Newton's method for convex programming and Tschebyscheff approximation
cites work: Lower subdifferentiable functions and their minimization by cutting planes
cites work: The minimization of lower subdifferentiable functions under nonlinear constraints: An all feasible cutting plane algorithm
cites work: Q3785482
cites work: What is quasiconvex analysis?
cites work: Lower subdifferentiability and integration
cites work: On Quasi-Convex Duality
cites work: Weak lower subdifferentials and applications
cites work: $\alpha $-Lower Subdifferentiable Functions
cites work: Fractional programming by lower subdifferentiability techniques
cites work: A descent algorithm for nonsmooth convex optimization
DOI: 10.1007/S10957-010-9762-6
Recommended article: Lower subdifferentiable functions and their minimization by cutting planes
Recommended article: Q4400647
Recommended article: Q5072169
Recommended article: The minimization of lower subdifferentiable functions under nonlinear constraints: An all feasible cutting plane algorithm
Recommended article: Cutting plane algorithms for nonlinear semi-definite programming problems with applications
Recommended article: Q5199367
Recommended article: On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs
Recommended article: Q3002766
Recommended article: Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets
Recommended article: A cutting plane algorithm for linear reverse convex programs
description: scientific article; zbMATH DE number 5886726