Reformulation and convex relaxation techniques for global optimization
From MaRDI portal
Publication:1762890
DOI10.1007/s10288-004-0038-6zbMath1136.90442OpenAlexW2030485731MaRDI QIDQ1762890
Publication date: 11 February 2005
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10044/1/11807
Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Related Items
Deterministic global optimization in ab-initio quantum chemistry, Mixed integer nonlinear programming tools: an updated practical overview, Constraint reformulations for set point optimization problems using fuzzy cognitive map models, Efficient separation of RLT cuts for implicit and explicit bilinear products, Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs, Cutting ellipses from area-minimizing rectangles, Reformulations in Mathematical Programming: Definitions and Systematics, Cutting circles and polygons from area-minimizing rectangles, Mixed integer nonlinear programming tools: a practical overview, Properties, extensions and application of piecewise linearization for Euclidean norm optimization in \(\mathbb{R}^2\), Convexity and level sets for interval-valued fuzzy sets, The Kissing Number Problem: A New Result from Global Optimization
Uses Software
Cites Work
