Cutting plane algorithms and approximate lower subdifferentiability

DOI10.1007/S10957-010-9762-6zbMATH Open1250.90090OpenAlexW2047833292MaRDI QIDQ535075FDOQ535075

Authors: Jean-Paul Penot, P. H. Quang 

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

Recommendations

• Lower subdifferentiable functions and their minimization by cutting planes
• scientific article; zbMATH DE number 1182577
• scientific article; zbMATH DE number 7514021
• The minimization of lower subdifferentiable functions under nonlinear constraints: An all feasible cutting plane algorithm
• Cutting plane algorithms for nonlinear semi-definite programming problems with applications
• On the cutting plane property and the Bregman proximal point algorithm
• On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs
• Rank bounds and integrality gaps for cutting planes procedures
• Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets
• A cutting plane algorithm for linear reverse convex programs

zbMATH Keywords

nonsmooth optimizationcutting plane methodquasi-convex functionapproximation minizationlower subdifferentiallower subgradient

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cites Work

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

Cited In (7)

• Lower subdifferentiability of quadratic functions
• The minimization of lower subdifferentiable functions under nonlinear constraints: An all feasible cutting plane algorithm
• Lower subdifferentiable functions and their minimization by cutting planes
• Complexity estimates of some cutting plane methods based on the analytic barrier
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q535075)