Convex Programming Methods for Global Optimization

DOI10.1007/11425076_4MaRDI QIDQ5450796zbMATH OpenOpenAlexFDO

Authors John N. Hooker

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

Mathematics Subject Classification ID

Convex programming (90C25) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Convex-concave programming as a decomposition approach to global optimization
• A polyhedral branch-and-cut approach to global optimization
• Global optimization of nonconvex factorable programming problems
• A reformulation-convexification approach for solving nonconvex quadratic programming problems
• \(\alpha BB\): A global optimization method for general constrained nonconvex problems

Cited in

(17)

• On the system of two all different\(\_\)predicates
• Enumerative techniques for solving some nonconvex global optimization problems
• On consistency in probabilistic logic for logical formulas represented by B-hypertrees
• Convex-concave programming as a decomposition approach to global optimization
• A one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problems
• Global optimization of nonconvex problems with convex-transformable intermediates
• A polyhedral branch-and-cut approach to global optimization
• A global optimization method for nonconvex separable programming problems
• Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
• A general framework for convexity analysis in deterministic global optimization
• A decomposition approach for global optimum search in QP, NLP and MINLP problems
• A linear-time transformation of linear inequalities into conjunctive normal form
• scientific article; zbMATH DE number 4051358 (Why is no real title available?)
• scientific article; zbMATH DE number 1857672 (Why is no real title available?)
• The Evolution of Methods of Convex Optimization
• Assessment of a non-adaptive deterministic global optimization algorithm for problems with low-dimensional non-convex subspaces
• The complexity of recursive constraint satisfaction problems

This page was built for publication: Convex Programming Methods for Global Optimization

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