Convex Programming Methods for Global Optimization
From MaRDI portal
Publication:5450796
DOI10.1007/11425076_4zbMath1132.90362OpenAlexW1607663111MaRDI QIDQ5450796
Publication date: 14 March 2008
Published in: Global Optimization and Constraint Satisfaction (Search for Journal in Brave)
Full work available at URL: https://figshare.com/articles/journal_contribution/Convex_Programming_Methods_for_Global_Optimization/6704807
Convex programming (90C25) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Related Items
A linear-time transformation of linear inequalities into conjunctive normal form ⋮ The complexity of recursive constraint satisfaction problems ⋮ A one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problems ⋮ On the system of two all different\(\_\)predicates ⋮ On consistency in probabilistic logic for logical formulas represented by \(B\)-hypertrees
