A geometric characterization of ``optimality-equivalent relaxations

DOI10.1007/s10898-007-9275-5zbMath1188.90250OpenAlexW2013047989MaRDI QIDQ1016070

Walid Ben-Ameur, José Neto

Publication date: 4 May 2009

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-007-9275-5

zbMATH Keywords

sensitivity analysisconvex relaxationconvex geometry

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Second-order cone programming
• Epsilon-proximal decomposition method
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Linear optimization and extensions
• A new algorithm for minimizing convex functions over convex sets
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• A constraint generation algorithm for large scale linear programs using multiple-points separation
• Edmonds polytopes and a hierarchy of combinatorial problems
• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
• Outline of an algorithm for integer solutions to linear programs
• The Cutting-Plane Method for Solving Convex Programs
• Semidefinite optimization
• Acceleration of cutting-plane and column generation algorithms: Applications to network design
• Cones of Matrices and Set-Functions and 0–1 Optimization
• A central cutting plane algorithm for the convex programming problem
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• On constrained optimization by adjoint based quasi-Newton methods
• The omnipresence of Lagrange

This page was built for publication: A geometric characterization of ``optimality-equivalent relaxations