Related papers: Linear optimization over homogeneous matrix cones
In this paper we first extend from normed spaces to locally convex spaces some characterizations of denting points in convex sets. On the other hand, we also prove that in an infrabarreled locally convex space a point in a convex set is…
This paper deals with proper holomorphic self-maps of smoothly bounded pseudoconvex domains in $\C^2$. We study the dynamical properties of their extension to the boundary and show that their non-wandering sets are always contained in the…
The problem of minimizing a (nonconvex) quadratic form over the unit simplex, referred to as a standard quadratic program, admits an exact convex conic formulation over the computationally intractable cone of completely positive matrices.…
Semidefinite programming is a fundamental problem class in convex optimization, but despite recent advances in solvers, solving large-scale semidefinite programs remains challenging. Generally the matrix functions involved are spectral or…
The short-time and global behaviour are studied for an autonomous linear evolution equation, which is defined by a generator inducing a uniformly bounded holomorphic semigroup in a Hilbert space. A general necessary and sufficient condition…
The H-unistochastic matrices are a special class of symmetric bistochastic matrices obtained by taking the square of the absolute value of each entry of a Hermitian unitary matrix. We examine the geometric relationship of the convex hull of…
In this paper we consider the problem of distributed nonlinear optimisation of a separable convex cost function over a graph subject to cone constraints. We show how to generalise, using convex analysis, monotone operator theory and…
A submanifold in a real space form attaining equality in the DDVV inequality at every point is called a Wintgen ideal submanifold. They are invariant objects under the Moebius transformations. In this paper, we classify those Wintgen ideal…
Self-similar curves are a recurring motif in nature. The tension-free stationary states of conformally invariant energies describe the simplest curves of this form. Planar logarithmic spirals, for example, are associated with conformal…
A closed convex conic subset $\mathcal{S}$ of the positive semidefinite (PSD) cone is rank-one generated (ROG) if all of its extreme rays are generated by rank-one matrices. The ROG property of $\mathcal{S}$ is closely related to the…
We consider optimization problems containing nonconvex quadratic functions for which semidefinite programming (SDP) relaxations often yield strong bounds. We investigate linear inequalities that outer approximate the positive semidefinite…
In this paper we theoretically show that interior-point methods based on self-concordant barriers possess favorable global complexity beyond their standard application area of convex optimization. To do that we propose first- and…
Approximations of optimization problems arise in computational procedures and sensitivity analysis. The resulting effect on solutions can be significant, with even small approximations of components of a problem translating into large…
There is a growing mechanics literature concerning the macroscopic properties of mechanism-based mechanical metamaterials. This amounts mathematically to a homogenization problem involving nonlinear elasticity. A key goal is to identify the…
This paper presents a nonsmooth proximal point technique for convex optimization in a special class of Hadamard manifold called homogeneous domains of positivity. The method is based on the particularization of the Rham decomposition…
In this thesis, we present results related to complementarity problems. We study the linear complementarity problems on extended second order cones. We convert a linear complementarity problem on an extended second order cone into a mixed…
The modern theory of homogeneous structures begins with the work of Roland Fra\"iss\'e. The theory developed in the last seventy years is placed in the border area between combinatorics, model theory, algebra, and analysis. We turn our…
We give two characterizations of cones over ellipsoids in real normed vector spaces. Let $C$ be a closed convex cone with nonempty interior such that $C$ has a bounded section of codimension $1$. We show that $C$ is a cone over an ellipsoid…
We address the non-convex optimisation problem of finding a sparse matrix on the Stiefel manifold (matrices with mutually orthogonal columns of unit length) that maximises (or minimises) a quadratic objective function. Optimisation problems…
This paper proposes and analyzes a communication-efficient distributed optimization framework for general nonconvex nonsmooth signal processing and machine learning problems under an asynchronous protocol. At each iteration, worker machines…