Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming

DOI10.1007/S13675-017-0088-0zbMATH Open1390.90401OpenAlexW2737166611MaRDI QIDQ1742902FDOQ1742902

Authors: Dimitri J. Papageorgiou, Francisco Trespalacios 

Publication date: 12 April 2018

Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13675-017-0088-0

Recommendations

• Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem
• Improved Lagrangean decomposition: An application to the generalized assignment problem
• A bound-improving approach to discrete programming problems
• Lagrangean decomposition: A model yielding stronger lagrangean bounds
• A feasibility-ensured Lagrangian heuristic for general decomposable problems
• A class of convergent primal-dual subgradient algorithms for decomposable convex programs
• scientific article; zbMATH DE number 6027005
• A hierarchy of relaxations for nonlinear convex generalized disjunctive programming
• scientific article; zbMATH DE number 4045481

zbMATH Keywords

\(K\)-means clusteringdisjunctive programmingLagrangian decompositionbasic stepmixed-integer conic quadratic optimization

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Cites Work

• Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
• Title not available (Why is that?)
• Title not available (Why is that?)
• Branching rules revisited
• A branch-and-cut method for 0-1 mixed convex programming
• Convex programming for disjunctive convex optimization
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• Disjunctive programming: Properties of the convex hull of feasible points
• Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
• Disjunctive Programming
• Lagrangean relaxation. (With comments and rejoinder).
• Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
• On mathematical programming with indicator constraints
• Lagrangean relaxation of the hull-reformulation of linear generalized disjunctive programs and its use in disjunctive branch and bound
• A hierarchy of relaxations for linear generalized disjunctive programming
• A hierarchy of relaxations for nonlinear convex generalized disjunctive programming
• Title not available (Why is that?)
• Algorithmic approach for improved mixed-integer reformulations of convex generalized disjunctive programs
• Disjunctive Programming
• On handling indicator constraints in mixed integer programming

Cited In (4)

• Between steps: intermediate relaxations between big-M and convex hull formulations
• Title not available (Why is that?)
• Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones
• Solving net-constrained clustering problem

This page was built for publication: Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming

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