Inexact solution of NLP subproblems in MINLP

Authors:
M. Li;L. N. Vicente
Affiliations:
Department of Mathematics, University of Coimbra, Coimbra, Portugal 3001-454;CMUC, Department of Mathematics, University of Coimbra, Coimbra, Portugal 3001-454
Venue:
Journal of Global Optimization
Year:
2013

Citing 9
Cited 0

An outer-approximation algorithm for a class of mixed-integer nonlinear programs

Mathematical Programming: Series A and B
Decomposition in general mathematical programming

Mathematical Programming: Series A and B
Solving mixed integer nonlinear programs by outer approximation

Mathematical Programming: Series A and B
Global optimization of mixed-integer nonlinear programs: A theoretical and computational study

Mathematical Programming: Series A and B
A Feasibility Pump for mixed integer nonlinear programs

Mathematical Programming: Series A and B
Branching and bounds tighteningtechniques for non-convex MINLP

Optimization Methods & Software - GLOBAL OPTIMIZATION
A probing algorithm for MINLP with failure prediction by SVM

CPAIOR'11 Proceedings of the 8th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Heuristics for convex mixed integer nonlinear programs

Computational Optimization and Applications
An algorithmic framework for convex mixed integer nonlinear programs

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the context of convex mixed integer nonlinear programming (MINLP), we investigate how the outer approximation method and the generalized Benders decomposition method are affected when the respective nonlinear programming (NLP) subproblems are solved inexactly. We show that the cuts in the corresponding master problems can be changed to incorporate the inexact residuals, still rendering equivalence and finiteness in the limit case. Some numerical results will be presented to illustrate the behavior of the methods under NLP subproblem inexactness.