Methods of embedding-cutting off in problems of mathematical programming

DOI10.1007/s10898-009-9523-yzbMath1229.90134OpenAlexW1995580004MaRDI QIDQ1959250

Valerian Bulatov

Publication date: 6 October 2010

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-009-9523-y

zbMATH Keywords

global optimizationcutting planeconcave minorantnondegenerate matrixsecond-order cutsection plane

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items

Reverse convex problems: an approach based on optimality conditions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Cutting-Plane Method for Solving Convex Programs
• On stability and stationary points in nonlinear optimization
• Nonlinear Programming: A Numerical Survey
• The Supporting Hyperplane Method for Unimodal Programming
• Cutting-Plane Methods without Nested Constraint Sets