A trust region SQP algorithm for mixed-integer nonlinear programming
From MaRDI portal
Publication:2463830
DOI10.1007/s11590-006-0026-1zbMath1152.90551MaRDI QIDQ2463830
Klaus Schittkowski, Oliver Exler
Publication date: 6 December 2007
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-006-0026-1
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal design of electronic components by mixed-integer nonlinear programming
- A trust region algorithm for equality constrained optimization
- Handbook of test problems in local and global optimization
- An improved branch and bound algorithm for mixed integer nonlinear programs
- Solving mixed integer nonlinear programs by outer approximation
- Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints
- Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
- On the convergence of a new trust region algorithm
- Pattern Search Algorithms for Mixed Variable Programming
- An Example of Only Linear Convergence of Trust Region Algorithms for Non-smooth Optimization
- On the global convergence of trust region algorithms for unconstrained minimization
- On the superlinear convergence of a trust region algorithm for nonsmooth optimization
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- A Trust Region Algorithm for Nonlinearly Constrained Optimization
- A Robust Trust Region Method for Constrained Nonlinear Programming Problems
- Trust Region Methods
- Integrating SQP and branch-and-bound for mixed integer nonlinear programming
