Cutting plane algorithms and approximate lower subdifferentiability

DOI10.1007/s10957-010-9762-6zbMath1250.90090OpenAlexW2047833292MaRDI QIDQ535075

Pham Hong Quang, Jean-Paul Penot

Publication date: 11 May 2011

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-010-9762-6

zbMATH Keywords

nonsmooth optimizationcutting plane methodquasi-convex functionapproximation minizationlower subdifferentiallower subgradient

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cites Work

• Unnamed Item
• Lower subdifferentiable functions and their minimization by cutting planes
• Fractional programming by lower subdifferentiability techniques
• The minimization of lower subdifferentiable functions under nonlinear constraints: An all feasible cutting plane algorithm
• Newton's method for convex programming and Tschebyscheff approximation
• Lower subdifferentiability and integration
• Weak lower subdifferentials and applications
• The Cutting-Plane Method for Solving Convex Programs
• A descent algorithm for nonsmooth convex optimization
• $\alpha $-Lower Subdifferentiable Functions
• What is quasiconvex analysis?
• On Quasi-Convex Duality

This page was built for publication: Cutting plane algorithms and approximate lower subdifferentiability