Integrating SQP and branch-and-bound for mixed integer nonlinear programming
From MaRDI portal
Publication:5942943
DOI10.1023/A:1011241421041zbMath1009.90074OpenAlexW1541170979MaRDI QIDQ5942943
Publication date: 22 April 2003
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1011241421041
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Methods of successive quadratic programming type (90C55)
Related Items
Constructing Lattice-Free Gradient Polyhedra in Dimension Two, Trajectory planning for autonomous underwater vehicles in the presence of obstacles and a nonlinear flow field using mixed integer nonlinear programming, Binary Optimal Control of Single-Flux-Quantum Pulse Sequences, Algorithms and Software for Convex Mixed Integer Nonlinear Programs, Using Interior-Point Methods within an Outer Approximation Framework for Mixed Integer Nonlinear Programming, A competitive inexact nonmonotone filter SQP method: convergence analysis and numerical results, Finding multiple solutions to general integer linear programs, Operational planning of combined heat and power plants through genetic algorithms for mixed 0-1 nonlinear programming, Mixed integer nonlinear programming tools: an updated practical overview, On solving generalized convex MINLP problems using supporting hyperplane techniques, A heuristic for the label printing problem, A new local and global optimization method for mixed integer quadratic programming problems, An overview of MINLP algorithms and their implementation in Muriqui optimizer, Generalized Benders Decomposition for one Class of MINLPs with Vector Conic Constraint, Two linear approximation algorithms for convex mixed integer nonlinear programming, Adapting derivative free optimization methods to engineering models with discrete variables, Fill‐rate service level constrained distribution network design, Extended formulations in mixed integer conic quadratic programming, On solving nonsmooth mixed-integer nonlinear programming problems by outer approximation and generalized benders decomposition, A local relaxation method for the cardinality constrained portfolio optimization problem, Outer approximation algorithm for one class of convex mixed-integer nonlinear programming problems with partial differentiability, Convergence of derivative-free nonmonotone direct search methods for unconstrained and box-constrained mixed-integer optimization, A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization, Heuristics for convex mixed integer nonlinear programs, A trajectory-based method for mixed integer nonlinear programming problems, A review of deterministic optimization methods in engineering and management, Finding multiple optimal solutions of signomial discrete programming problems with free variables, An augmented Lagrangian filter method, Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming, Optimization methods for mixed integer weakly concave programming problems, Fast chaotic optimization algorithm based on spatiotemporal maps for global optimization, A trust region SQP algorithm for mixed-integer nonlinear programming, A new approach for solving mixed integer DC programs using a continuous relaxation with no integrality gap and smoothing techniques, An algorithmic framework for convex mixed integer nonlinear programs, Mixed integer programming with a class of nonlinear convex constraints, Regularized optimization methods for convex MINLP problems, An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming, Modeling and control of switching max-plus-linear systems with random and deterministic switching, Solving a dynamic separation problem using MINLP techniques, A dynamic convexized method for nonconvex mixed integer nonlinear programming, Concurrent processing of mixed‐integer non‐linear programming problems, Mixed integer programming for a special logic constrained optimal control problem, Solving convex MINLP optimization problems using a sequential cutting plane algorithm, Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra, Solving nonlinear constrained optimization problems: an immune evolutionary based two-phase approach, The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming, Enhanced linear reformulation for engineering optimization models with discrete and bounded continuous variables, Partially distributed outer approximation, The stochastic trim-loss problem, Convex mixed integer nonlinear programming problems and an outer approximation algorithm, A geometric branch and bound method for robust maximization of convex functions, Global optimization of signomial mixed-integer nonlinear programming problems with free variables, Mixed integer nonlinear programming tools: a practical overview, On sequential and parallel non-monotone derivative-free algorithms for box constrained optimization, An algorithm for two-stage stochastic mixed-integer nonlinear convex problems, Constructing lattice-free gradient polyhedra in dimension two, Logic-based modeling and solution of nonlinear discrete/continuous optimization problems
Uses Software
