In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...
Abstract. We present a new “lifting” approach for the solution of nonlinear optimization problems (NLPs) that have objective and constraint functions with intermediate variable...
-In this paper a nonlinear programming approach is used for the minimization of total communication cost to determine the optimum room dimensions for each room. The nonlinear progr...
We propose an SQP-type algorithm for solving nonlinear second-order cone programming (NSOCP) problems. At every iteration, the algorithm solves a convex SOCP subproblem in which th...
We present an algorithm for solving a general min-cut, twoway partitioning problem subject to timing constraints. The problem is formulated as a constrained programming problem an...