Solving disjunctive optimization problems by generalized semi-infinite optimization techniques
DOI10.1007/S10957-016-0862-9zbMATH Open1342.90210OpenAlexW2234456864MaRDI QIDQ301738FDOQ301738
Authors: Peter Kirst, Oliver Stein 
Publication date: 1 July 2016
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-016-0862-9
Recommendations
smoothingdisjunctive optimizationgeneralized semi-infinite optimizationlower-level dualitymathematical program with complementarity constraints
Cites Work
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Practical bilevel optimization. Algorithms and applications
- Optimization. Algorithms and consistent approximations
- Foundations of bilevel programming
- Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
- Title not available (Why is that?)
- Title not available (Why is that?)
- A smoothing method for mathematical programs with equilibrium constraints
- Solving mixed integer nonlinear programs by outer approximation
- Error bounds in mathematical programming
- Bi-level strategies in semi-infinite programming.
- On generalized semi-infinite optimization and bilevel optimization
- Semi-Infinite Programming: Theory, Methods, and Applications
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Nonlinear Programming
- Semi-infinite programming
- Disjunctive programming: Properties of the convex hull of feasible points
- Title not available (Why is that?)
- Disjunctive Programming
- Mixed logical-linear programming
- An algorithm for disjunctive programs
- A branch-and-bound approach for solving a class of generalized semi-infinite programming problems
- Disjunctive optimization: Critical point theory
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation
- Review of nonlinear mixed-integer and disjunctive programming techniques
- A lifting method for generalized semi-infinite programs based on lower level Wolfe duality
- How to solve a semi-infinite optimization problem
- Empirical evidence for the Birch and Swinnerton-Dyer conjectures for modular Jacobians of genus 2 curves
- Title not available (Why is that?)
- Solving Semi-Infinite Optimization Problems with Interior Point Techniques
- A survey on error bounds for lower semicontinuous functions
- A tree-search algorithm for mixed integer programming problems
- Feasible method for generalized semi-infinite programming
- Lift-and-project for mixed 0-1 programming: recent progress
- Generalized semi-infinite programming: a tutorial
Cited In (10)
- Recent advances in nonconvex semi-infinite programming: applications and algorithms
- Global optimization of disjunctive programs
- About disjunctive optimization.
- An interleaved depth-first search method for the linear optimization problem with disjunctive constraints
- Generalized partial computation using disunification to solve constraints
- Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets
- Achieving MILP feasibility quickly using general disjunctions
- Solving problems with min-type functions by disjunctive programming
- Optimization of discrete-continuous dynamic systems based on disjunctive programming
- Global optimization of generalized semi-infinite programs using disjunctive programming
Uses Software
This page was built for publication: Solving disjunctive optimization problems by generalized semi-infinite optimization techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q301738)
