Integrating SQP and branch-and-bound for mixed integer nonlinear programming
From MaRDI portal
Recommendations
- A trust region SQP algorithm for mixed-integer nonlinear programming
- Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming
- A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization
- On branching rules for convex mixed-integer nonlinear optimization
- Mixed-integer nonlinear optimization
Cited in
(66)- The stochastic trim-loss problem
- Global optimization of signomial mixed-integer nonlinear programming problems with free variables
- Trajectory planning for autonomous underwater vehicles in the presence of obstacles and a nonlinear flow field using mixed integer nonlinear programming
- On solving generalized convex MINLP problems using supporting hyperplane techniques
- Extended formulations in mixed integer conic quadratic programming
- A trajectory-based method for mixed integer nonlinear programming problems
- Mixed integer programming with a class of nonlinear convex constraints
- Mixed integer programming for a special logic constrained optimal control problem
- Solving large MINLPs on computational grids
- A local relaxation method for the cardinality constrained portfolio optimization problem
- A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization
- A review of deterministic optimization methods in engineering and management
- Partially distributed outer approximation
- A geometric branch and bound method for robust maximization of convex functions
- Constructing lattice-free gradient polyhedra in dimension two
- An overview of MINLP algorithms and their implementation in Muriqui optimizer
- An augmented Lagrangian filter method
- Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra
- Solving nonlinear constrained optimization problems: an immune evolutionary based two-phase approach
- Enhanced linear reformulation for engineering optimization models with discrete and bounded continuous variables
- Finding multiple solutions to general integer linear programs
- Mixed integer nonlinear programming tools: an updated practical overview
- On solving nonsmooth mixed-integer nonlinear programming problems by outer approximation and generalized benders decomposition
- Finding multiple optimal solutions of signomial discrete programming problems with free variables
- A trust region SQP algorithm for mixed-integer nonlinear programming
- An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming
- Solving a dynamic separation problem using MINLP techniques
- Solving convex MINLP optimization problems using a sequential cutting plane algorithm
- An algorithm for two-stage stochastic mixed-integer nonlinear convex problems
- A partitioning algorithm for the mixed integer nonlinear programming problem
- Two linear approximation algorithms for convex mixed integer nonlinear programming
- On sequential and parallel non-monotone derivative-free algorithms for box constrained optimization
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- Using interior-point methods within an outer approximation framework for mixed integer nonlinear programming
- Generalized Benders decomposition for one class of MINLPs with vector conic constraint
- Operational planning of combined heat and power plants through genetic algorithms for mixed 0-1 nonlinear programming
- A flexible platform for mixed-integer non-linear programming problems
- Adapting derivative free optimization methods to engineering models with discrete variables
- Heuristics for convex mixed integer nonlinear programs
- scientific article; zbMATH DE number 1489804 (Why is no real title available?)
- Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming
- Optimization methods for mixed integer weakly concave programming problems
- Concurrent processing of mixed-integer non-linear programming problems
- Constructing lattice-free gradient polyhedra in dimension two
- Binary optimal control of single-flux-quantum pulse sequences
- A competitive inexact nonmonotone filter SQP method: convergence analysis and numerical results
- A new approach for solving mixed integer DC programs using a continuous relaxation with no integrality gap and smoothing techniques
- Regularized optimization methods for convex MINLP problems
- A dynamic convexized method for nonconvex mixed integer nonlinear programming
- The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
- Fill‐rate service level constrained distribution network design
- A new local and global optimization method for mixed integer quadratic programming problems
- Convergence of derivative-free nonmonotone direct search methods for unconstrained and box-constrained mixed-integer optimization
- Outer approximation for pseudo-convex mixed-integer nonlinear program problems
- Input regularization for integer optimal control in BV with applications to control of poroelastic and poroviscoelastic systems
- PyOED: an extensible suite for data assimilation and model-constrained optimal design of experiments
- Fast chaotic optimization algorithm based on spatiotemporal maps for global optimization
- Modeling and control of switching max-plus-linear systems with random and deterministic switching
- 50 years of mixed-integer nonlinear and disjunctive programming
- Convex mixed integer nonlinear programming problems and an outer approximation algorithm
- Mixed integer nonlinear programming tools: a practical overview
- Logic-based modeling and solution of nonlinear discrete/continuous optimization problems
- A heuristic for the label printing problem
- Outer approximation algorithm for one class of convex mixed-integer nonlinear programming problems with partial differentiability
- An algorithmic framework for convex mixed integer nonlinear programs
- Optimal design of electronic components by mixed-integer nonlinear programming
This page was built for publication: Integrating SQP and branch-and-bound for mixed integer nonlinear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5942943)
