Global optimization of disjunctive programs
From MaRDI portal
Publication:1679482
DOI10.1007/S10898-017-0526-9zbMATH Open1373.90117OpenAlexW2609080421MaRDI QIDQ1679482FDOQ1679482
Authors: Peter Kirst, Fabian Rigterink, Oliver Stein 
Publication date: 9 November 2017
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-017-0526-9
Recommendations
- Solving disjunctive optimization problems by generalized semi-infinite optimization techniques
- Global optimization of generalized semi-infinite programs using disjunctive programming
- Generalized disjunctive programming: a framework for formulation and alternative algorithms for MINLP optimization
- Solving problems with min-type functions by disjunctive programming
- An algorithm for disjunctive programs
Cites Work
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- Solving mixed integer nonlinear programs by outer approximation
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Interval Methods for Systems of Equations
- Title not available (Why is that?)
- Disjunctive programming: Properties of the convex hull of feasible points
- Modelling with integer variables
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Mixed logical-linear programming
- Title not available (Why is that?)
- An algorithm for disjunctive programs
- Disjunctive optimization: Critical point theory
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Empirical evidence for the Birch and Swinnerton-Dyer conjectures for modular Jacobians of genus 2 curves
- Solving disjunctive optimization problems by generalized semi-infinite optimization techniques
- Lift-and-project for mixed 0-1 programming: recent progress
- A hierarchy of relaxations for linear generalized disjunctive programming
- A hierarchy of relaxations for nonlinear convex generalized disjunctive programming
- Generalized Disjunctive Programming: A Framework for Formulation and Alternative Algorithms for MINLP Optimization
- A class of problems where dual bounds beat underestimation bounds
- Optimal centered forms
- Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
- Critical sets in parametric optimization
- Disjunctive Programming
- Title not available (Why is that?)
- Dual bounding procedures lead to convergent branch-and-bound algorithms
- Die zentrische Form in der Intervallarithmetik, ihre quadratische Konvergenz und ihre Inklusionsisotonie
Cited In (6)
- An adaptive agent-based process model for optimizing innovative design
- An interleaved depth-first search method for the linear optimization problem with disjunctive constraints
- Second-order optimality conditions and improved convergence results for regularization methods for cardinality-constrained optimization problems
- Global optimization of generalized semi-infinite programs using disjunctive programming
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Title not available (Why is that?)
Uses Software
This page was built for publication: Global optimization of disjunctive programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1679482)
