Related papers: On representing the positive semidefinite cone usi…
In this paper, we analyze optimal control problems governed by semilinear parabolic equations. Box constraints for the controls are imposed and the cost functional involves the state and possibly a sparsity-promoting term, but not a…
We give an extension to a nonconvex setting of the classical radial representation result for lower semicontinuous envelope of a convex function on the boundary of its effective domain. We introduce the concept of radial uniform upper…
Recently, Chubanov proposed an interesting new polynomial-time algorithm for linear program. In this paper, we extend his algorithm to second-order cone programming.
We propose a new method for linear second-order cone programs. It is based on the sequential quadratic programming framework for nonlinear programming. In contrast to interior point methods, it can capitalize on the warm-start capabilities…
The structure of maximal faces of the cone of completely positive matrices is still not well understood in higher dimensions, mainly due to the lack of a general characterization of extreme exposed rays of the copositive cone beyond small…
In this paper, we introduce a new second-order directional derivative and a second-order subdifferential of Hadamard type for an arbitrary nondifferentiable function. We derive several second-order optimality conditions for a local and a…
The aim of the present paper is to investigate the half-spaces in the convexity structure of all quasiorders on a given set and to use them in an alternative approach to classical order dimension. The main result states that linear orders…
First-order conic optimization solvers are sensitive to problem conditioning and typically perform poorly in the face of ill-conditioned problem data. To mitigate this, we propose an approach to preconditioning--the hypersphere…
Using the dual cone of sums of nonnegative circuits (SONC), we provide a relaxation of the global optimization problem to minimize an exponential sum and, as a special case, a multivariate real polynomial. Our approach builds on two key…
There has been a lot of interest recently in proving lower bounds on the size of linear programs needed to represent a given polytope P. In a breakthrough paper Fiorini et al. [Proceedings of 44th ACM Symposium on Theory of Computing 2012,…
Neural implicit representations have shown substantial improvements in efficiently storing 3D data, when compared to conventional formats. However, the focus of existing work has mainly been on storage and subsequent reconstruction. In this…
We review several (and provide new) results on the theory of moments, sums of squares and basic semi-algebraic sets when convexity is present. In particular, we show that under convexity, the hierarchy of semidefinite relaxations for…
Using geometric methods for linearizing systems of second order cubically semi-linear ordinary differential equations, we extend to the third order by differentiating the second order equation. This yields criteria for linearizability of a…
Second-order polynomials generalize classical first-order ones in allowing for additional variables that range over functions rather than values. We are motivated by their applications in higher-order computational complexity theory,…
We examine the convexity and tractability of the two-sided linear chance constraint model under Gaussian uncertainty. We show that these constraints can be applied directly to model a larger class of nonlinear chance constraints as well as…
Problems related to projections on closed convex cones are frequently encountered in optimization theory and related fields. To study these problems, various unifying ideas have been introduced, including asymmetric vector-valued norms and…
In this paper, using an optimal partition approach, we study the parametric analysis of a second-order conic optimization problem, where the objective function is perturbed along a fixed direction. We characterize the notions of so-called…
Using a well-ordering on the reals, one can prove there exists a partition of the three-dimensional Euclidean space into unit circles (PUC). We show that the converse does not hold: there exist models of $\mathsf{ZF}$ without a…
We deploy algebraic complexity theoretic techniques for constructing symmetric determinantal representations of for00504925mulas and weakly skew circuits. Our representations produce matrices of much smaller dimensions than those given in…
Previous algorithms can solve convex-concave minimax problems $\min_{x \in \mathcal{X}} \max_{y \in \mathcal{Y}} f(x,y)$ with $\mathcal{O}(\epsilon^{-2/3})$ second-order oracle calls using Newton-type methods. This result has been…