Using Interior-Point Methods within an Outer Approximation Framework for Mixed Integer Nonlinear Programming
From MaRDI portal
Publication:2897298
DOI10.1007/978-1-4614-1927-3_7zbMath1242.90119OpenAlexW157872908MaRDI QIDQ2897298
Publication date: 10 July 2012
Published in: Mixed Integer Nonlinear Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-1927-3_7
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new self-dual embedding method for convex programming
- Conic mixed-integer rounding cuts
- An algorithmic framework for convex mixed integer nonlinear programs
- Interior-point methods for nonconvex nonlinear programming: Regularization and warmstarts
- An interior-point algorithm for nonconvex nonlinear programming
- Solving mixed integer nonlinear programs by outer approximation
- A quasi-Newton penalty barrier method for convex minimization problems
- Solving problems with semidefinite and related constraints using interior-point methods for nonlinear programming
- Interior-point methods for nonconvex nonlinear programming: Filter methods and merit functions
- BARON: A general purpose global optimization software package
- An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming
- Generalized Benders decomposition
- MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming
- FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs
- Infeasibility Detection and SQP Methods for Nonlinear Optimization
- An Interior-Point $$\boldsymbol{\ell_{1}}$$ -Penalty Method for Nonlinear Optimization
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties
- LOQO user's manual — version 3.10
- Conic convex programming and self-dual embedding
- Integrating SQP and branch-and-bound for mixed integer nonlinear programming
