Pages that link to "Item:Q5942943"
From MaRDI portal
The following pages link to Integrating SQP and branch-and-bound for mixed integer nonlinear programming (Q5942943):
Displaying 50 items.
- An algorithm for two-stage stochastic mixed-integer nonlinear convex problems (Q256673) (← links)
- Operational planning of combined heat and power plants through genetic algorithms for mixed 0-1 nonlinear programming (Q337450) (← links)
- Adapting derivative free optimization methods to engineering models with discrete variables (Q400044) (← links)
- Heuristics for convex mixed integer nonlinear programs (Q429468) (← links)
- Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming (Q486413) (← links)
- Optimization methods for mixed integer weakly concave programming problems (Q489113) (← links)
- Regularized optimization methods for convex MINLP problems (Q518454) (← links)
- A dynamic convexized method for nonconvex mixed integer nonlinear programming (Q547132) (← links)
- A new local and global optimization method for mixed integer quadratic programming problems (Q606807) (← links)
- Fast chaotic optimization algorithm based on spatiotemporal maps for global optimization (Q668682) (← links)
- Modeling and control of switching max-plus-linear systems with random and deterministic switching (Q692382) (← links)
- Convex mixed integer nonlinear programming problems and an outer approximation algorithm (Q746812) (← links)
- Mixed integer nonlinear programming tools: a practical overview (Q766256) (← links)
- Logic-based modeling and solution of nonlinear discrete/continuous optimization problems (Q817192) (← links)
- A heuristic for the label printing problem (Q875404) (← links)
- Outer approximation algorithm for one class of convex mixed-integer nonlinear programming problems with partial differentiability (Q896190) (← links)
- An algorithmic framework for convex mixed integer nonlinear programs (Q951092) (← links)
- The stochastic trim-loss problem (Q1011257) (← links)
- Global optimization of signomial mixed-integer nonlinear programming problems with free variables (Q1024826) (← links)
- Trajectory planning for autonomous underwater vehicles in the presence of obstacles and a nonlinear flow field using mixed integer nonlinear programming (Q1628043) (← links)
- On solving generalized convex MINLP problems using supporting hyperplane techniques (Q1668811) (← links)
- Extended formulations in mixed integer conic quadratic programming (Q1688453) (← links)
- A trajectory-based method for mixed integer nonlinear programming problems (Q1704918) (← links)
- Mixed integer programming with a class of nonlinear convex constraints (Q1751218) (← links)
- Mixed integer programming for a special logic constrained optimal control problem (Q1780957) (← links)
- A local relaxation method for the cardinality constrained portfolio optimization problem (Q1935581) (← links)
- A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization (Q1946925) (← links)
- A review of deterministic optimization methods in engineering and management (Q1955154) (← links)
- Partially distributed outer approximation (Q2046262) (← links)
- A geometric branch and bound method for robust maximization of convex functions (Q2052396) (← links)
- Constructing lattice-free gradient polyhedra in dimension two (Q2118128) (← links)
- An overview of MINLP algorithms and their implementation in Muriqui optimizer (Q2178345) (← links)
- An augmented Lagrangian filter method (Q2216190) (← links)
- Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra (Q2281450) (← links)
- Solving nonlinear constrained optimization problems: an immune evolutionary based two-phase approach (Q2282675) (← links)
- Enhanced linear reformulation for engineering optimization models with discrete and bounded continuous variables (Q2295318) (← links)
- Finding multiple solutions to general integer linear programs (Q2384650) (← links)
- Mixed integer nonlinear programming tools: an updated practical overview (Q2393446) (← links)
- On solving nonsmooth mixed-integer nonlinear programming problems by outer approximation and generalized benders decomposition (Q2420817) (← links)
- Finding multiple optimal solutions of signomial discrete programming problems with free variables (Q2443364) (← links)
- A trust region SQP algorithm for mixed-integer nonlinear programming (Q2463830) (← links)
- An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming (Q2477012) (← links)
- Solving a dynamic separation problem using MINLP techniques (Q2480935) (← links)
- Solving convex MINLP optimization problems using a sequential cutting plane algorithm (Q2506191) (← links)
- Two linear approximation algorithms for convex mixed integer nonlinear programming (Q2675735) (← links)
- On sequential and parallel non-monotone derivative-free algorithms for box constrained optimization (Q2867433) (← links)
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs (Q2897292) (← links)
- Using Interior-Point Methods within an Outer Approximation Framework for Mixed Integer Nonlinear Programming (Q2897298) (← links)
- Generalized Benders Decomposition for one Class of MINLPs with Vector Conic Constraint (Q2947228) (← links)
- Concurrent processing of mixed‐integer non‐linear programming problems (Q4932950) (← links)
