Related papers: Critical Multipliers in Semidefinite Programming
We present a derivative-based algorithm for nonlinearly constrained optimization problems that is tolerant of inaccuracies in the data. The algorithm solves a semi-smooth set of nonlinear equations that are equivalent to the first-order…
We derive several efficiently computable converse bounds for quantum communication over quantum channels in both the one-shot and asymptotic regime. First, we derive one-shot semidefinite programming (SDP) converse bounds on the amount of…
We consider a Br\'ezis-Nirenberg type critical growth $p$-Laplacian problem involving a parameter $\mu > 0$ in a smooth bounded domain $\Omega$. We prove the existence of multiple nontrivial solutions if either $\mu$ or the volume of…
Semidefinite Programming (SDP) provides tight lower bounds for Optimal Power Flow problems. However, solving large-scale SDP problems requires exploiting sparsity. In this paper, we experiment several clique decomposition algorithms that…
In this paper we prove existence and multiplicity results of unbounded critical points for a general class of weakly lower semicontinuous functionals. We will apply a suitable nonsmooth critical point theory.
We introduce an innovative numerical technique based on convex optimization to solve a range of infinite dimensional variational problems arising from the application of the background method to fluid flows. In contrast to most existing…
It is considered a semilinear elliptic partial differential equation in $\mathbb{R}^N$ with a potential that may vanish at infinity and a nonlinear term with subcritical growth. A positive solution is proved to exist depending on the…
Clustering is a hard discrete optimization problem. Nonconvex approaches such as low-rank semidefinite programming (SDP) have recently demonstrated promising statistical and local algorithmic guarantees for cluster recovery. Due to the…
Resolving a conjecture of Abbe, Bandeira and Hall, the authors have recently shown that the semidefinite programming (SDP) relaxation of the maximum likelihood estimator achieves the sharp threshold for exactly recovering the community…
Semidefinite programs (SDPs) play a crucial role in control theory, traditionally as a computational tool. Beyond computation, the duality theory in convex optimization also provides valuable analytical insights and new proofs of classical…
In this paper we provide necessary and sufficient (KKT) conditions for global optimality for a new class of possibly nonconvex quadratically constrained quadratic programming (QCQP) problems, denoted by S-QCQP. The class consists of QCQP…
This paper deals with a nonlinear filtering problem in which a multi-dimensional signal process is additively affected by a process $\nu$ whose components have paths of bounded variation. The presence of the process $\nu$ prevents from…
This paper presents a novel outer approximation algorithm for nonsmooth mixed-integer nonlinear programming (MINLP) problems. The method proceeds by fixing the integer variables and solving the resulting nonlinear convex subproblem. When…
In this paper, we derive explicit second-order necessary and sufficient optimality conditions of a local minimizer to an optimal control problem for a quasilinear second-order partial differential equation with a piecewise smooth but not…
Barrier certificates, serving as differential invariants that witness system safety, play a crucial role in the verification of cyber-physical systems (CPS). Prevailing computational methods for synthesizing barrier certificates are based…
We consider the problem of estimating the discrete clustering structures under the Sub-Gaussian Mixture Model. Our main results establish a hidden integrality property of a semidefinite programming (SDP) relaxation for this problem: while…
In this paper, we present an efficient semismooth Newton method, named SSNCP, for solving a class of semidefinite programming problems. Our approach is rooted in an equivalent semismooth system derived from the saddle point problem induced…
This article introduces a novel distributionally robust model predictive control (DRMPC) algorithm for a specific class of controlled dynamical systems where the disturbance multiplies the state and control variables. These classes of…
This paper investigates constrained nonsmooth multiobjective fractional programming problem (NMFP) in real Banach spaces. It derives a quotient calculus rule for computing the first- and second-order Clarke derivatives of fractional…
This paper explores some sufficient conditions for the enhanced solvability of strong vector equilibrium problems, which can be established via a variational approach. Enhanced solvability here means existence of solutions, which are strong…