A trajectory-based method for mixed integer nonlinear programming problems
From MaRDI portal
Publication:1704918
DOI10.1007/s10898-017-0570-5zbMath1393.90075OpenAlexW2757608017MaRDI QIDQ1704918
M. Montaz Ali, Terry-Leigh Oliphant
Publication date: 13 March 2018
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-017-0570-5
system of ordinary differential equationspattern searchmixed integer nonlinear programmingneighborhoodlocal minimizertrajectory-based methodsubproblem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Transformation-based preprocessing for mixed-integer quadratic programs
- Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization
- An interior point cutting plane heuristic for mixed integer programming
- An improved version of the original leap-frog dynamic method for unconstrained minimization: LFOP1(b)
- Nonlinear optimization with engineering applications
- A new and dynamic method for unconstrained minimization
- Handbook of test problems in local and global optimization
- Solving mixed integer nonlinear programs by outer approximation
- Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
- A global optimization algorithm for linear fractional and bilinear programs
- An exact penalty global optimization approach for mixed-integer programming problems
- A note on convex reformulation schemes for mixed integer quadratic programs
- Linear transformation based solution methods for non-convex mixed integer quadratic programs
- FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs
- The boundedness of penalty parameters in an augmented Lagrangian method with constrained subproblems
- Optimization Methods in Finance
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Numerical Optimization
- Optimal Order and Stepsize Sequences
- A tree-search algorithm for mixed integer programming problems
- Integrating SQP and branch-and-bound for mixed integer nonlinear programming
This page was built for publication: A trajectory-based method for mixed integer nonlinear programming problems
