Globally convergent cutting plane method for nonconvex nonsmooth minimization
type: Item
instance of: scholarly article
title: Globally convergent cutting plane method for nonconvex nonsmooth minimization
zbMATH Open document ID: 1229.90140
author: N. Karmitsa
author: Mario Tanaka Filho
author: José Herskovits
published in: Journal of Optimization Theory and Applications
publication date: 2011-05-11T00:00:00Z
review text: The authors propose an algorithm for solving nonsmooth nonconvex unconstrained programming problems together with some convergence results. This algorithm generates a sequence of interior points of the epigraph of the objective function whose accumulation points are stationary points of the original problem, and so, in case the objective is convex, this is a global minimum of the problem. Some numerical experiments are also given.
reviewed by: Do Van Luu
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 49M37
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 5886730
zbMATH Keywords: nonsmooth nonconvex programming
zbMATH Keywords: traditional cutting plane method
zbMATH Keywords: bundle methods
zbMATH Keywords: feasible direction interior point methods
MaRDI profile type: Publication
full work available at URL: s10957-010-9766-2
OpenAlex ID: W2059066757
Wikidata QID: Q109595694
cites work: Newton's method for convex programming and Tschebyscheff approximation
cites work: The Cutting-Plane Method for Solving Convex Programs
cites work: Feasible direction interior-point technique for nonlinear optimization
cites work: Methods of descent for nondifferentiable optimization
cites work: Q4004158
cites work: A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
cites work: A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization
cites work: Optimization and nonsmooth analysis
cites work: A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties
cites work: A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
DOI: 10.1007/S10957-010-9766-2
description: scientific article; zbMATH DE number 5886730