Related papers: Second-order optimality conditions for SDCMPCC and…
In this paper, we obtain a new proof of Fritz John necessary optimality conditions for vector problems applying Kakutani fixed point theorem and Hadamard directional derivative. We also derive a similar proof of second-order Fritz John…
In this paper, we study a class of fractional semi-infinite polynomial programming (FSIPP) problems, in which the objective is a fraction of a convex polynomial and a concave polynomial, and the constraints consist of infinitely many convex…
In this paper we consider an optimal control problem governed by a semilinear heat equation with bilinear control-state terms and subject to control and state constraints. The state constraints are of integral type, the integral being with…
We consider the Chance Constrained Model Predictive Control problem for polynomial systems subject to disturbances. In this problem, we aim at finding optimal control input for given disturbed dynamical system to minimize a given cost…
In this paper we study directional second-order tangent sets of real and complex analytic sets. For an analytic set $X\subseteq \mathbb K^n$ and a nonzero tangent direction $u\in T_0X$, we compare the geometric directional second-order…
In this paper we study constraint qualifications and optimality conditions for bilevel programming problems. We strive to derive checkable constraint qualifications in terms of problem data and applicable optimality conditions. For the…
This paper studies a fundamental problem in convex optimization, which is to solve semidefinite programming (SDP) with high accuracy. This paper follows from the existing robust SDP-based interior point method analysis due to [Huang, Jiang,…
This paper is dedicated to the analysis of infinite horizon optimal control problems subject to semilinear parabolic equations with constraints on the controls and discounted cost functionals. The discount factors on the cost and the state…
For a general nonlinear control system, we study the problem of small time local attainability of a target which is the closure of an open set. When the target is smooth and locally the sublevel set of a smooth function, we develop second…
A set is called semidefinite representable or semidefinite programming (SDP) representable if it can be represented as the projection of a higher dimensional set which is represented by some Linear Matrix Inequality (LMI). This paper…
For bilevel programs with a convex lower level program, the classical approach replaces the lower level program with its Karush-Kuhn-Tucker condition and solve the resulting mathematical program with complementarity constraint (MPCC). It is…
Optimality is a critical aspect of Model Predictive Control (MPC), especially in economic MPC. However, achieving optimality in MPC presents significant challenges, and may even be impossible, due to inherent inaccuracies in the predictive…
We consider the problem of designing an optimal quantum detector to minimize the probability of a detection error when distinguishing between a collection of quantum states, represented by a set of density operators. We show that the design…
We consider an optimal control problem governed by a semilinear PDE in cases where the optimal control is of bang-bang type. By utilizing the theory of Bessel potential space, we characterize quadratic growth of the objective via a…
Rapid advances in data collection and processing capabilities have allowed for the use of increasingly complex models that give rise to nonconvex optimization problems. These formulations, however, can be arbitrarily difficult to solve in…
Semidefinite programs (SDPs) -- some of the most useful and versatile optimization problems of the last few decades -- are often pathological: the optimal values of the primal and dual problems may differ and may not be attained. Such SDPs…
In this paper, we study the stochastic linear complementarity problems on extended second order cones (stochastic ESOCLCP). We first convert the problem to a stochastic mixed complementarity problem on the nonegative orthant (SMixCP).…
In the paper, we describe all total orders $\succ$ compatible with addition on additive subsemigroup $S$ of finite dimensional spaces over rational numbers. We provide a necessary and sufficient condition under which a finitely generated…
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…
We propose a simple, scalable, and fast gradient descent algorithm to optimize a nonconvex objective for the rank minimization problem and a closely related family of semidefinite programs. With $O(r^3 \kappa^2 n \log n)$ random…