Reformulation and convex relaxation techniques for global optimization
From MaRDI portal
Publication:1762890
DOI10.1007/S10288-004-0038-6zbMATH Open1136.90442OpenAlexW2030485731MaRDI QIDQ1762890FDOQ1762890
Authors: Leo Liberti 
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
Quadratic programming (90C20) Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26)
Cites Work
Cited In (13)
- Mixed integer nonlinear programming tools: a practical overview
- Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs
- Reformulations in Mathematical Programming: Definitions and Systematics
- Constraint reformulations for set point optimization problems using fuzzy cognitive map models
- Cutting circles and polygons from area-minimizing rectangles
- A reliable affine relaxation method for global optimization
- Efficient separation of RLT cuts for implicit and explicit bilinear products
- Deterministic global optimization in ab-initio quantum chemistry
- Cutting ellipses from area-minimizing rectangles
- The Kissing Number Problem: A New Result from Global Optimization
- Properties, extensions and application of piecewise linearization for Euclidean norm optimization in \(\mathbb{R}^2\)
- Convexity and level sets for interval-valued fuzzy sets
- Mixed integer nonlinear programming tools: an updated practical overview
Uses Software
This page was built for publication: Reformulation and convex relaxation techniques for global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1762890)
