Generating Feasible Points for Mixed-Integer Convex Optimization Problems by Inner Parallel Cuts
From MaRDI portal
Publication:5158763
DOI10.1137/20M131922XzbMath1479.90142OpenAlexW3202889218MaRDI QIDQ5158763
Christoph Neumann, Oliver Stein
Publication date: 26 October 2021
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/20m131922x
outer approximationcutting planesgranularityglobal error boundextended cutting plane algorithmconvex MINLPinner parallel setfeasible rounding
Integer programming (90C10) Mixed integer programming (90C11) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31)
Related Items
Feasible rounding approaches for equality constrained mixed-integer optimization problems, Feasible rounding based diving strategies in branch-and-bound methods for mixed-integer optimization
Uses Software
Cites Work
- Unnamed Item
- Error bounds for mixed integer linear optimization problems
- Error bounds for mixed integer nonlinear optimization problems
- Heuristics for convex mixed integer nonlinear programs
- RENS. The optimal rounding
- An algorithmic framework for convex mixed integer nonlinear programs
- A feasibility pump for mixed integer nonlinear programs
- Feasibility pump 2.0
- The sharp Lipschitz constants for feasible and optimal solutions of a perturbed linear program
- Solving mixed integer nonlinear programs by outer approximation
- Error bounds in mathematical programming
- Polyhedral approximation in mixed-integer convex optimization
- Bounds on the objective value of feasible roundings
- Granularity in nonlinear mixed-integer optimization
- A feasible rounding approach for mixed-integer optimization problems
- Undercover: a primal MINLP heuristic exploring a largest sub-MIP
- Improving the feasibility pump
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- The feasibility pump
- MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming
- An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs
- The Cutting-Plane Method for Solving Convex Programs
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Interval Methods for Systems of Equations
- An Application of Error Bounds for Convex Programming in a Linear Space
- Sharp Lipschitz Constants for Basic Optimal Solutions and Basic Feasible Solutions of Linear Programs
- Sharp Estimates for Hoffman's Constant for Systems of Linear Inequalities and Equalities
- A survey on error bounds for lower semicontinuous functions
- Lipschitz Continuity of Solutions of Linear Inequalities, Programs and Complementarity Problems
- Error bounds for solutions of linear equations and inequalities
- Mixed-integer nonlinear optimization
- The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
