Related papers: Aubin Property and Strong Regularity Are Equivalen…
In this workshop, we present a compact but rigorous introduction to second-order optimality conditions for mathematical programs with equilibrium constraints (MPECs). We start from the classical nonlinear programming template, then explain…
Finite-dimensional linear programs satisfy strong duality (SD) and have the "dual pricing" (DP) property. The (DP) property ensures that, given a sufficiently small perturbation of the right-hand-side vector, there exists a dual solution…
We study weak solutions and minimizers $u$ of the non-autonomous problems $\operatorname{div} A(x, Du)=0$ and $\min_v \int_\Omega F(x,Dv)\,dx$ with quasi-isotropic $(p, q)$-growth. We consider the case that $u$ is bounded, H\"older…
We are concerned with the homogenization of second-order linear elliptic equations with random coefficient fields. For symmetric coefficient fields with only short-range correlations, quantified through a logarithmic Sobolev inequality for…
In this work, we address a parabolic problem featuring a potentially doubly nonlinear term, governed by a combination of local and nonlocal operators (see Problem P1 below). We first establish the local existence of weak energy solutions…
This paper investigates regularity properties of two non-negative sparsity sets: non-negative sparse vectors, and low-rank positive semi-definite matrices. Novel formulae for their Mordukhovich normal cones are given and used to formulate…
A bipartite bilinear program (BBP) is a quadratically constrained quadratic optimization problem where the variables can be partitioned into two sets such that fixing the variables in any one of the sets results in a linear program. We…
In this paper, we accomplish a 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…
We introduce a conic embedding condition that gives a hierarchy of cones and cone programs. This condition is satisfied by a large number of convex cones including the cone of copositive matrices, the cone of completely positive matrices,…
The problem of domain aiming control is formulated for controlled stochastic nonlinear systems. This issue involves regularity of the solution to the resulting closed-loop stochastic system. To begin with, an extended existence and…
The facial reduction algorithm of Borwein and Wolkowicz and the extended dual of Ramana provide a strong dual for the conic linear program $$ (P) \sup {<c, x> | Ax \leq_K b} $$ in the absence of any constraint qualification. The facial…
We establish existence, uniqueness and optimal regularity results for very weak solutions to certain nonlinear elliptic boundary value problems. We introduce structural asymptotic assumptions of Uhlenbeck type on the nonlinearity, which are…
Stochastic Optimal Control Problems (SOCPs) plays a major role in the sequential decision-making challenges. There exist various iterative algorithms, under framework of stochastic maximum principle, that sequentially find the optimal…
The objective of this work is to study weak infeasibility in second order cone programming. For this purpose, we consider a relaxation sequence of feasibility problems that mostly preserve the feasibility status of the original problem.…
In this paper, we investigate second-order necessary conditions and exact penalty of mathematical programs with switching constraints (MPSC). Some new second-order constraint qualifications and second-order quasi-normality are introduced…
A sharp pointwise differential inequality for vectorial second-order partial differential operators, with Uhlenbeck structure, is offered. As a consequence, optimal second-order regularity properties of solutions to nonlinear elliptic…
We consider the problem of approximating Quadratic O-1 Integer Programs with bounded number of constraints and non-negative constraint matrix entries, which we term as PIQP. We describe and analyze a randomized algorithm based on a program…
This work continues an ongoing effort to compare non-smooth optimization problems in abs-normal form to Mathematical Programs with Complementarity Constraints (MPCCs). We study general Nonlinear Programs with equality and inequality…
In theory, hierarchies of semidefinite programming (SDP) relaxations based on sum of squares (SOS) polynomials have been shown to provide arbitrarily close approximations for a general polynomial optimization problem (POP). However, due to…
In this article, we study the regularity of solutions to inhomogeneous time-fractional evolution equations involving anisotropic non-local operators in mixed-norm Sobolev spaces of variable order, with non-trivial initial conditions. The…