Using Interior-Point Methods within an Outer Approximation Framework for Mixed Integer Nonlinear Programming
- 15 November 2011
- book chapter
- Published by Springer Nature
- p. 225-243
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Infeasibility Detection and SQP Methods for Nonlinear OptimizationSIAM Journal on Optimization, 2010
- An algorithmic framework for convex mixed integer nonlinear programsDiscrete Optimization, 2008
- Interior-point methods for nonconvex nonlinear programming: regularization and warmstartsComputational Optimization and Applications, 2007
- An exact primal–dual penalty method approach to warmstarting interior-point methods for linear programmingComputational Optimization and Applications, 2007
- A Quasi-Newton Penalty Barrier Method for Convex Minimization ProblemsComputational Optimization and Applications, 2003
- Solving Problems with Semidefinite and Related Constraints Using Interior-Point Methods for Nonlinear ProgrammingMathematical Programming, 2003
- MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear ProgrammingINFORMS Journal on Computing, 2003
- Interior-Point Methods for Nonconvex Nonlinear Programming: Filter Methods and Merit FunctionsComputational Optimization and Applications, 2002
- Solving mixed integer nonlinear programs by outer approximationMathematical Programming, 1994
- An outer-approximation algorithm for a class of mixed-integer nonlinear programsMathematical Programming, 1986