scientific article; zbMATH DE number 7514021

MaRDI QIDQ5072169zbMATH OpenFDO

Authors A. R. Doagooei, Chr. Tammer

Publication date 25 April 2022

Full work available at URL http://yokohamapublishers.jp/online2/opaao/vol2/p159.html

zbMATH Keywords

abstract convexitycutting plane methoddegree-one calm functionminimum-type subgradientoptimization algorithm

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Analysis of algorithms and problem complexity (68Q25) Nonconvex programming, global optimization (90C26)

Recommendations

• Lower subdifferentiable functions and their minimization by cutting planes
• Cutting plane algorithms and approximate lower subdifferentiability
• On the solution of variational inequality problems by using cutting plane methods
• The minimization of lower subdifferentiable functions under nonlinear constraints: An all feasible cutting plane algorithm
• scientific article; zbMATH DE number 1867122
• Modified cutting plane method for minimization of a convex function
• A cutting plane method for solving minimax problems in the complex plane
• scientific article; zbMATH DE number 996545
• A cutting hyperplane projection method for solving generalized quasi-variational inequalities
• A cutting plane method for solving quasimonotone variational inequalities

Cited in

(4)

• The minimization of lower subdifferentiable functions under nonlinear constraints: An all feasible cutting plane algorithm
• Generalized \(\gamma\)-valid cut procedure for concave minimization
• Generalized cutting plane method for solving nonlinear stochastic programming problems
• Cutting plane algorithms and approximate lower subdifferentiability

This page was built for publication:

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