Cutting methods in E n+ 1 for global optimization of a class of functions

DOI10.1134/s0965542507110036MaRDI QIDQ6123120

Valerian Bulatov, O. V. Khamisov

Publication date: 4 March 2024

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/zvmmf218

zbMATH Keywords

global optimizationcutting planecutting methodnonsingular matrixconcave minorant

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items (5)

A minimization method with approximation of feasible set and epigraph of objective function ⋮ Optimization of the optimal value function in problems of convex parametric programming ⋮ A cutting method with approximation of a constraint region and an epigraph for solving conditional minimization problems ⋮ Approximating a solution set of nonlinear inequalities ⋮ A two-stage cutting-plane method for conditional minimizing function

Cites Work

• Unnamed Item

This page was built for publication: Cutting methods in E n+ 1 for global optimization of a class of functions