In semidefinite programming, one minimizes a linear function subject to the constraint that an affine combination of symmetric matrices is positive semidefinite. Such a constraint is nonlinear and nonsmooth, but convex, so semidefinite programs are convex optimization problems. Semidefinite programming unifies several standard problems (e.g., linear and quadratic programming) and finds many app...

Abstract. Logic-based methods provide a strategy for applying convex nonlinear programming to nonconvex global optimization. Such methods assume that the problem becomes convex when selected variables are fixed. The selected variables must be discrete, or else discretized if they are continuous. We provide a tutorial survey of disjunctive programming with convex relaxations, logic-based outer a...

Convex programming is a subclass of nonlinear programming (NLP) that unifies and generalizes least squares (LS), linear programming (LP), and convex quadratic programming (QP). This generalization is achieved while maintaining many of the important, attractive theoretical properties of these predecessors. Numerical algorithms for solving convex programs are maturing rapidly, providing reliabili...

We consider nonlinear systems dx=dt = f(x(t)) where Df(x(t)) is known to lie in the convex hull of L matrices A1, : : : , AL 2 R n . For such systems, quadratic Lyapunov functions can be determined using convex programming techniques [1]. This paper describes an algorithm that either nds a quadratic Lyapunov function or terminates with a proof that no quadratic Lyapunov function exists. The alg...

This paper considers state-of-the-art convex relaxations for the AC power flow equations and introduces valid cuts based on convex envelopes and lifted nonlinear constraints. These valid linear inequalities strengthen existing semidefinite and quadratic programming relaxations and dominate existing cuts proposed in the literature. Combined with model intersection and bound tightening, the new l...

The concept of mixed-type duality has been extended to the class of multiobjective fractional variational control problems. A number of duality relations are proved to relate the efficient solutions of the primal and its mixed-type dual problems. The results are obtained for ρ-convex (generalized ρ-convex) functions. The results generalize a number of duality results previously obtained for fin...