Hongkai Dai and Russ Tedrake. Global inverse kinemat- ics via mixed integer convex optimization. 2017.H. Dai, G. Izatt, and R. Tedrake, "Global inverse kinematics via mixed- integer convex optimization," in ISRR
[1][2022] Motion Planning around Obstacles with Convex Optimization [2][2022] Shortest Paths in Graphs of Convex Sets [3][2016] Aggressive Quadrotor Flight through Cluttered Environments Using Mixed Integer Programming [4][2015] Efficient Mixed-Integer Planning for {UAVs} in Cluttered Environments ...
9.1 Integer modelingA general mixed integer conic optimization problem has the form(9.1)minimizecTxsubject toAx=b,x∈K,xi∈Z,∀i∈I,where K is a cone and I⊆{1,…,n} denotes the set of variables that are constrained to be integers....
We investigate the theoretical complexity of branch-and-bound (BB) and cutting plane (CP) algorithms for mixed-integer optimization. In particular, we study the relative efficiency of BB and CP, when both are based on the same family of disjunctions. We extend a result of Dash (International...
You cannot include these constraints inquadprog. The difficulty is the discrete nature of the constraints. Furthermore, while the mixed-integer linear programming solver does handle discrete constraints, it does not address quadratic objective functions. ...
This example shows how to solve a Mixed-Integer Quadratic Programming (MIQP) portfolio optimization problem using the problem-based approach. The idea is to iteratively solve a sequence of mixed-integer linear programming (MILP) problems that locally approximate the MIQP problem. For the solver-...
We survey mixed-integer programming techniques as they are applied in bilevel optimization. • We focus on bilevel problems with convex or linear lower-level problems as well as on problems with mixed-integer lower levels. • Special attention is given to bilevel pricing problems, Stackelberg...
This books presents the fundamentals of nonlinear and mixed-integer optimization, and their applications in the important area of process synthesis in chemical engineering. The reader is acquainted with the basics of convex analysis and nonlinear optimization and is introduced to the elementary concepts ...
Numerical experience with mixed-integer dynamic optimization. NSF Design and Manufacturing Grantees Conference, 5-8th January 1999, Long Beach, CA. Kesavan P. and P. I. Barton, 2000. Decomposition algorithms for nonconvex mixed-integer nonlinear programs. AIChE Symposium Series 96, 458. McCormick ...
Solving Pseudo-Convex Mixed Integer Optimization Problems by Cutting Plane Techniques'Optimization and Engineering 3,253-280, 2002, by Tapio Westerlund and Ray P�rn, but with several modifications. The solverstoaMINLPis using a Single-search Tree Outer Approximation algorithm to solve Mixed-Integer...