A geometric characterization of ``optimality-equivalent'' relaxations
type: Item
instance of: scholarly article
title: A geometric characterization of ``optimality-equivalent'' relaxations
zbMATH Open document ID: 1188.90250
author: Walid Ben-Ameur
author: José Neto
published in: Journal of Global Optimization
publication date: 2009-05-04T00:00:00Z
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 5550499
zbMATH Keywords: convex relaxation
zbMATH Keywords: convex geometry
zbMATH Keywords: sensitivity analysis
MaRDI profile type: Publication
full work available at URL: s10898-007-9275-5
OpenAlex ID: W2013047989
cites work: Second-order cone programming
cites work: A lift-and-project cutting plane algorithm for mixed 0-1 programs
cites work: A constraint generation algorithm for large scale linear programs using multiple-points separation
cites work: Acceleration of cutting-plane and column generation algorithms: Applications to network design
cites work: Q5755521
cites work: Q4821526
cites work: Edmonds polytopes and a hierarchy of combinatorial problems
cites work: A central cutting plane algorithm for the convex programming problem
cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
cites work: On constrained optimization by adjoint based quasi-Newton methods
cites work: Outline of an algorithm for integer solutions to linear programs
cites work: Q3141900
cites work: The Cutting-Plane Method for Solving Convex Programs
cites work: Cones of Matrices and Set-Functions and 0–1 Optimization
cites work: The omnipresence of Lagrange
cites work: Q4040221
cites work: Epsilon-proximal decomposition method
cites work: Linear optimization and extensions
cites work: Q4840775
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
cites work: Semidefinite optimization
cites work: A new algorithm for minimizing convex functions over convex sets
DOI: 10.1007/S10898-007-9275-5
description: scientific article; zbMATH DE number 5550499