Canonical duality theory is a potentially powerful methodology, which can be used to solve a wide class of discrete and continuous global optimization problems. This paper presents a brief review and recent developments of this theory with applications to some well-know problems including polynomial minimization, mixed integer and fractional programming, nonconvex minimization with nonconvex qu...

In this paper we study the problem of nding the shortest path between two points lying on the surface of a (possibly nonconvex) polyhedron which is constrained so that a given point on the surface of the polyhedron must be seen from some point in the path. Our algorithm runs in time O(n 2 log n) for the convex polyhedron and O(n 3 log n) for nonconvex case. The method used is based on the subdi...

Delamination is a typical failure mode of composite materials caused by weak bonding. It arises when a crack initiates and propagates under a destructive loading. Given the physical law characterizing the properties of the interlayer adhesive between the bonded bodies, we consider the problem of computing the propagation of the crack front and the stress field along the contact boundary. This l...

We adapt the Douglas-Rachford (DR) splitting method to solve nonconvex feasibility problems by studying this method for a class of nonconvex optimization problem. While the convergence properties of the method for convex problems have been well studied, far less is known in the nonconvex setting. In this paper, for the direct adaptation of the method to minimize the sum of a proper closed funct...

We study a boundary value problem for a fractional differential inclusion of order α ∈ (1, 2] with non-separated boundary conditions involving a nonconvex set-valued map. We establish a Filippov type existence theorem and we prove the arcwise connectedness of the solution set of the problem considered.

We consider nonlinear nonconvex evolution inclusions driven by time-varying subdifferentials 0(t,x) without assuming that (t,.) is of compact type. We show the existence of extremal solutions and then we prove a strong relaxation theorem. Moreover,r we show that under a Lipschitz condition on the orientor field, the solution set of the nonconvex problem is path-connected in C(T,H). These result...

The classical trust-region subproblem (TRS) minimizes a nonconvex quadratic objective over the unit ball. In this paper, we consider extensions of TRS having extra constraints. When two parallel cuts are added to TRS, we show that the resulting nonconvex problem has an exact representation as a semidefinite program with additional linear and second-order-cone constraints. For the case where an ...

We describe an implementation of the Feasibility Pump heuristic for nonconvex MINLPs. Our implementation takes advantage of three novel techniques, which we discuss here: a hierarchy of procedures for obtaining an integer solution, a generalized definition of the distance function that takes into account the nonlinear character of the problem, and the insertion of linearization cuts for nonconv...

Direct current (DC) electricity distribution systems have been proposed as an alternative to traditional, alternating current (AC) distribution systems for commercial buildings. Partial replacement of AC distribution with DC distribution can improve service to DC loads and overall building energy efficiency. This article develops (i) a mixed-integer, nonlinear, nonconvex mathematical programmin...

We consider a nonlinear nonconvex network flow problem that arises, for example, in natural gas or water transmission networks. Given is such network with active and passive components, that is, valves, compressors, pressure regulators (active) and pipelines (passive), and a desired amount of flow at certain specified entry and exit nodes of the network. Besides flow conservation constraints in...