Nonlinear Semidefinite Programming Research Articles

Superlinear convergence of a stabilized SQP-type method for nonlinear semidefinite programming

Superlinear convergence of a stabilized SQP-type method for nonlinear semidefinite programming

A globally convergent SQP-type method with least constraint violation for nonlinear semidefinite programming

A globally convergent SQP-type method with least constraint violation for nonlinear semidefinite programming

Strong Variational Sufficiency for Nonlinear Semidefinite Programming and Its Implications

Strong Variational Sufficiency for Nonlinear Semidefinite Programming and Its Implications

Local convergence analysis of augmented Lagrangian method for nonlinear semidefinite programming

Local convergence analysis of augmented Lagrangian method for nonlinear semidefinite programming

Weak notions of nondegeneracy in nonlinear semidefinite programming

Weak notions of nondegeneracy in nonlinear semidefinite programming

On the Weak Second-order Optimality Condition for Nonlinear Semidefinite and Second-order Cone Programming

On the Weak Second-order Optimality Condition for Nonlinear Semidefinite and Second-order Cone Programming

Distributionally robust expected residual minimization for stochastic variational inequality problems

The stochastic variational inequality problem (SVIP) is an equilibrium model that includes random variables and has been widely applied in various fields such as economics and engineering. Expected residual minimization (ERM) is an established model for obtaining a reasonable solution for the SVIP, and its objective function is an expected value of a suitable merit function for the SVIP. However, the ERM is restricted to the case where the distribution is known in advance. We extend the ERM to ensure the attainment of robust solutions for the SVIP under the uncertainty distribution (the extended ERM is referred to as distributionally robust expected residual minimization (DRERM), where the worst-case distribution is derived from the set of probability measures in which the expected value and variance take the same sample mean and variance, respectively). Under suitable assumptions, we demonstrate that the DRERM can be reformulated as a deterministic convex nonlinear semidefinite programming to avoid numerical integration.

Sequential Constant Rank Constraint Qualifications for Nonlinear Semidefinite Programming with Algorithmic Applications

Sequential Constant Rank Constraint Qualifications for Nonlinear Semidefinite Programming with Algorithmic Applications

Novel robust minimum error entropy wasserstein distribution kalman filter under model uncertainty and non-gaussian noise

Recently, the divergence-based minimax approach was proposed and introduced to robust Kalman filtering under model uncertainty and Gaussian noise, and it significantly outperformed the standard Kalman filter. In this study, we consider a new Wasserstein-distribution based Kalman filter in which model uncertainty and non-Gaussian noise exist simultaneously. First, we construct a joint Gaussian distribution of states and observations in state space. Then, we set the equivalent estimator joint Gaussian distribution as a Wasserstein ambiguity set allowable neighborhood centered on the true distribution. Thus, the estimator distribution problem is transformed into a minimax problem, and the model uncertainty is tolerated accordingly. Subsequently, we introduce minimum error entropy to optimize the minimax problem based on Wasserstein ambiguity sets, so as to handle the influence of non-Gaussian noise. The minimax problem constrained by the minimum error entropy is transformed into a semi-positive definite convex optimization problem. By constructing two iterative sub-problems that are mutually conditional, the nonlinear semi-definite program finite convex optimization problem is solved. Finally, the minimum error entropy Wasserstein distribution Kalman filter algorithm is proposed. Additionally, the convergence of the proposed algorithm is clarified, and its effectiveness verified by comparing a series of algorithms in typical simulation scenarios.

A stabilized sequential quadratic semidefinite programming method for degenerate nonlinear semidefinite programs

In this paper, we propose a new sequential quadratic semidefinite programming (SQSDP) method for solving degenerate nonlinear semidefinite programs (NSDPs), in which we produce iteration points by solving a sequence of stabilized quadratic semidefinite programming (QSDP) subproblems, which we derive from the minimax problem associated with the NSDP. Unlike the existing SQSDP methods, the proposed one allows us to solve those QSDP subproblems inexactly, and each QSDP is feasible. One more remarkable point of the proposed method is that constraint qualifications (CQs) or boundedness of Lagrange multiplier sequences are not required in the global convergence analysis. Specifically, without assuming such conditions, we prove the global convergence to a point satisfying any of the following: the stationary conditions for the feasibility problem, the approximate-Karush-Kuhn-Tucker (AKKT) conditions, and the trace-AKKT conditions. Finally, we conduct some numerical experiments to examine the efficiency of the proposed method.

Robust Interior Point Method for Quantum Key Distribution Rate Computation

Security proof methods for quantum key distribution, QKD, that are based on the numerical key rate calculation problem, are powerful in principle. However, the practicality of the methods are limited by computational resources and the efficiency and accuracy of the underlying algorithms for convex optimization. We derive a stable reformulation of the convex nonlinear semidefinite programming, SDP, model for the key rate calculation problems. We use this to develop an efficient, accurate algorithm. The stable reformulation is based on novel forms of facial reduction, FR, for both the linear constraints and nonlinear quantum relative entropy objective function. This allows for a Gauss-Newton type interior-point approach that avoids the need for perturbations to obtain strict feasibility, a technique currently used in the literature. The result is high accuracy solutions with theoretically proven lower bounds for the original QKD from the FR stable reformulation. This provides novel contributions for FR for general SDP. We report on empirical results that dramatically improve on speed and accuracy, as well as solving previously intractable problems.

Three numerical approaches to find mutually unbiased bases using Bell inequalities

Mutually unbiased bases correspond to highly useful pairs of measurements in quantum information theory. In the smallest composite dimension, six, it is known that between three and seven mutually unbiased bases exist, with a decades-old conjecture, known as Zauner's conjecture, stating that there exist at most three. Here we tackle Zauner's conjecture numerically through the construction of Bell inequalities for every pair of integers n,d≥2 that can be maximally violated in dimension d if and only if n MUBs exist in that dimension. Hence we turn Zauner's conjecture into an optimisation problem, which we address by means of three numerical methods: see-saw optimisation, non-linear semidefinite programming and Monte Carlo techniques. All three methods correctly identify the known cases in low dimensions and all suggest that there do not exist four mutually unbiased bases in dimension six, with all finding the same bases that numerically optimise the corresponding Bell inequality. Moreover, these numerical optimisers appear to coincide with the ``four most distant bases'' in dimension six, found through numerically optimising a distance measure in [P. Raynal, X. Lü, B.-G. Englert, {Phys. Rev. A}, { 83} 062303 (2011)]. Finally, the Monte Carlo results suggest that at most three MUBs exist in dimension ten.

Global Convergence of Algorithms Under Constant Rank Conditions for Nonlinear Second-Order Cone Programming

In Andreani et al. (Weak notions of nondegeneracy in nonlinear semidefinite programming, 2020), the classical notion of nondegeneracy (or transversality) and Robinson’s constraint qualification have been revisited in the context of nonlinear semidefinite programming exploiting the structure of the problem, namely its eigendecomposition. This allows formulating the conditions equivalently in terms of (positive) linear independence of significantly smaller sets of vectors. In this paper, we extend these ideas to the context of nonlinear second-order cone programming. For instance, for an m-dimensional second-order cone, instead of stating nondegeneracy at the vertex as the linear independence of m derivative vectors, we do it in terms of several statements of linear independence of 2 derivative vectors. This allows embedding the structure of the second-order cone into the formulation of nondegeneracy and, by extension, Robinson’s constraint qualification as well. This point of view is shown to be crucial in defining significantly weaker constraint qualifications such as the constant rank constraint qualification and the constant positive linear dependence condition. Also, these conditions are shown to be sufficient for guaranteeing global convergence of several algorithms, while still implying metric subregularity and without requiring boundedness of the set of Lagrange multipliers.

Convergence to a second-order critical point by a primal-dual interior point trust-region method for nonlinear semidefinite programming

In this paper, we propose a primal-dual interior point trust-region method for solving nonlinear semidefinite programming problems, in which the iterates converge to a point that satisfies the first-order and second-order optimality conditions. The method consists of the outer iteration (SDPIP-revised) that finds a Karush-Kuhn-Tucker (KKT) point which satisfies the second-order optimality condition, and the inner iteration (SDPTR-revised) that calculates an approximate barrier KKT point. Algorithm SDPTR-revised uses a commutative class of Newton-like directions within the framework of the trust-region method in the primal-dual space. In addition, we also use a direction of negative curvature when it exists. The proposed algorithm employs a new method that generates negative-curvature directions in the existence of -type penalty term for equality constraints. It is proved that there exists a limit point of the generated sequence which satisfies the second-order optimality condition along with the barrier KKT conditions.

Unified convergence analysis of a second-order method of multipliers for nonlinear conic programming

In this paper, we accomplish the unified convergence analysis of a second-order method of multipliers (i.e., a second-order augmented Lagrangian method) for solving the conventional nonlinear conic optimization problems. Specifically, the algorithm that we investigate incorporates a specially designed nonsmooth (generalized) Newton step to furnish a second-order update rule for the multipliers. We first show in a unified fashion that under a few abstract assumptions, the proposed method is locally convergent and possesses a (nonasymptotic) superlinear convergence rate, even though the penalty parameter is fixed and/or the strict complementarity fails. Subsequently, we demonstrate that for the three typical scenarios, i.e., the classic nonlinear programming, the nonlinear second-order cone programming and the nonlinear semidefinite programming, these abstract assumptions are nothing but exactly the implications of the iconic sufficient conditions that are assumed for establishing the Q-linear convergence rates of the method of multipliers without assuming the strict complementarity.

A Line Search SQP-type Method with Bi-object Strategy for Nonlinear Semidefinite Programming

A Line Search SQP-type Method with Bi-object Strategy for Nonlinear Semidefinite Programming

A worst-case approach to topology optimization for maximum stiffness under uncertain boundary displacement

We present a worst-case approach to topology optimization (TO) for maximum stiffness under boundary displacement parametrized by a matrix-valued scaling function times an uncertain vector giving its direction. The objective function in the TO problem is the minimum of the potential energy maximized over the set of boundary displacements, which in the absence of prescribed loads means maximizing the reaction loads arising from enforcing the boundary displacement. It is shown that the TO problem can be cast as the minimization of the maximum eigenvalue of a matrix depending on solutions to a small number of (linear elastic) state problems. Numerical solution of this potentially non-smooth problem using algorithms for smooth optimization, a non-linear semi-definite programming reformulation, and a non-smooth bundle method is discussed and tested.

Structural reliability under uncertainty in moments: distributionally-robust reliability-based design optimization

This study considers structural optimization under a reliability constraint, in which the input distribution is only partially known. Specifically, when it is only known that the expected value vector and the variance-covariance matrix of the input distribution belong to a given convex set, it is required that the failure probability of a structure should be no greater than a specified target value for any realization of the input distribution. We demonstrate that this distributionally-robust reliability constraint can be reduced equivalently to deterministic constraints. By using this reduction, we can handle a reliability-based design optimization problem under the distributionally-robust reliability constraint within the framework of deterministic optimization; in particular, nonlinear semidefinite programming. Two numerical examples are solved to demonstrate the relation between the optimal value and either the target reliability or the uncertainty magnitude.

Solving an inverse elliptic coefficient problem by convex non-linear semidefinite programming

Several applications in medical imaging and non-destructive material testing lead to inverse elliptic coefficient problems, where an unknown coefficient function in an elliptic PDE is to be determined from partial knowledge of its solutions. This is usually a highly non-linear ill-posed inverse problem, for which unique reconstructability results, stability estimates and global convergence of numerical methods are very hard to achieve. The aim of this note is to point out a new connection between inverse coefficient problems and semidefinite programming that may help addressing these challenges. We show that an inverse elliptic Robin transmission problem with finitely many measurements can be equivalently rewritten as a uniquely solvable convex non-linear semidefinite optimization problem. This allows to explicitly estimate the number of measurements that is required to achieve a desired resolution, to derive an error estimate for noisy data, and to overcome the problem of local minima that usually appears in optimization-based approaches for inverse coefficient problems.

Global optimality in minimum compliance topology optimization of frames and shells by moment-sum-of-squares hierarchy

The design of minimum-compliance bending-resistant structures with continuous cross-section parameters is a challenging task because of its inherent non-convexity. Our contribution develops a strategy that facilitates computing all guaranteed globally optimal solutions for frame and shell structures under multiple load cases and self-weight. To this purpose, we exploit the fact that the stiffness matrix is usually a polynomial function of design variables, allowing us to build an equivalent non-linear semidefinite programming formulation over a semi-algebraic feasible set. This formulation is subsequently solved using the Lasserre moment-sum-of-squares hierarchy, generating a sequence of outer convex approximations that monotonically converges from below to the optimum of the original problem. Globally optimal solutions can subsequently be extracted using the Curto-Fialkow flat extension theorem. Furthermore, we show that a simple correction to the solutions of the relaxed problems establishes a feasible upper bound, thereby deriving a simple sufficient condition of global $\varepsilon$-optimality. When the original problem possesses a unique minimum, we show that this solution is found with a zero optimality gap in the limit. These theoretical findings are illustrated on several examples of topology optimization of frames and shells, for which we observe that the hierarchy converges in a finite (rather small) number of steps.