Solving disjunctive optimization problems by generalized semi-infinite optimization techniques

DOI10.1007/S10957-016-0862-9zbMath1342.90210OpenAlexW2234456864MaRDI QIDQ301738

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

zbMATH Keywords

smoothingdisjunctive optimizationgeneralized semi-infinite optimizationlower-level dualitymathematical program with complementarity constraints

Mathematics Subject Classification ID

Nonlinear programming (90C30) Semi-infinite programming (90C34)

Related Items (3)

Global optimization of disjunctive programs ⋮ Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets ⋮ Recent advances in nonconvex semi-infinite programming: applications and algorithms

Uses Software

• Ipopt

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Feasible method for generalized semi-infinite programming
• Lift-and-project for mixed 0-1 programming: recent progress
• Semi-infinite programming
• Generalized semi-infinite programming: a tutorial
• An algorithm for disjunctive programs
• A branch-and-bound approach for solving a class of generalized semi-infinite programming problems
• Disjunctive programming: Properties of the convex hull of feasible points
• A smoothing method for mathematical programs with equilibrium constraints
• Practical bilevel optimization. Algorithms and applications
• Solving mixed integer nonlinear programs by outer approximation
• Optimization. Algorithms and consistent approximations
• Error bounds in mathematical programming
• Disjunctive optimization: Critical point theory
• Generalized convex disjunctive programming: Nonlinear convex hull relaxation
• Bi-level strategies in semi-infinite programming.
• Foundations of bilevel programming
• On generalized semi-infinite optimization and bilevel optimization
• Review of nonlinear mixed-integer and disjunctive programming techniques
• A lifting method for generalized semi-infinite programs based on lower level Wolfe duality
• Mixed logical-linear programming
• How to solve a semi-infinite optimization problem
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• Empirical evidence for the Birch and Swinnerton-Dyer conjectures for modular Jacobians of genus 2 curves
• Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
• Semi-Infinite Programming: Theory, Methods, and Applications
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs
• Disjunctive Programming
• Solving Semi-Infinite Optimization Problems with Interior Point Techniques
• A survey on error bounds for lower semicontinuous functions
• Nonlinear Programming
• A tree-search algorithm for mixed integer programming problems

This page was built for publication: Solving disjunctive optimization problems by generalized semi-infinite optimization techniques