Related papers: Complementarity and Related Problems
A simple model coupling a one-dimensional beam particle to a one-dimensional harmonic oscillator is used to explore complementarity and entanglement. This model, well-known in the inelastic scattering literature, is presented under three…
We analyse the singularity formation of congruences of solutions of systems of second order PDEs via the construction of \emph{shape maps}. The trace of such maps represents a congruence volume whose collapse we study through an appropriate…
This paper deals with the optimization of Bolza problem with a system of convex and nonconvex, discrete and differential state variable inequality constraints of second order by deriving necessary and sufficient conditions for optimality.…
We consider linear problems in the worst case setting. That is, given a linear operator and a pool of admissible linear measurements, we want to approximate the values of the operator uniformly on a convex and balanced set by means of…
Variational analysis provides the theoretical foundations and practical tools for constructing optimization algorithms without being restricted to smooth or convex problems. We survey the central concepts in the context of a concrete but…
This paper introduces a nonconforming virtual element method for general second-order elliptic problems with variable coefficients on domains with curved boundaries and curved internal interfaces. We prove arbitrary order optimal…
This paper considers the problem of smoothing convex functions and sets, seeking the nearest smooth convex function or set to a given one. For convex cones and sublinear functions, a full characterization of the set of all optimal…
We study a static portfolio optimization problem with two risk measures: a principle risk measure in the objective function and a secondary risk measure whose value is controlled in the constraints. This problem is of interest when it is…
This work aims to solve a stochastic nonconvex nonsmooth composite optimization problem. Previous works on composite optimization problem requires the major part to satisfy Lipschitz smoothness or some relaxed smoothness conditions, which…
We consider the complement value problem for a class of second order elliptic integro-differential operators. Let $D$ be a bounded Lipschitz domain of $\mathbb{R}^d$. Under mild conditions, we show that there exists a unique bounded…
Properties of solutions of the tensor complementarity problem (TCP) for structured tensors have been investigated in recent literature. In this paper, we make further contributions on this problem. Specifically, we first derive solution…
We first study Clarke's tangent cones at infinity to unbounded subsets of $\mathbb{R}^n.$ We prove that these cones are closed convex and show a characterization of their interiors. We then study subgradients at infinity for extended real…
Many existing branch and bound algorithms for multiobjective optimization problems require a significant computational cost to approximate the entire Pareto optimal solution set. In this paper, we propose a new branch and bound algorithm…
We consider several classes of highly important semidefinite optimization problems that involve both a convex objective function (smooth or nonsmooth) and additional linear or nonlinear smooth and convex constraints, which are ubiquitous in…
We present a unified study of first and second order necessary and sufficient optimality conditions for minimax and Chebyshev optimisation problems with cone constraints. First order optimality conditions for such problems can be formulated…
We examine the duality theory for a class of non-convex functions obtained by composing a convex function with a continuous one. Using Fenchel duality, we derive a dual problem that satisfies weak duality under general assumptions. To…
A conic program is the problem of optimizing a linear function over a closed convex cone intersected with an affine preimage of another cone. We analyse three constraint qualifications, namely a Closedness CQ, Slater CQ, and Boundedness CQ…
In this paper, we present sufficient conditions ensuring that the sum of the image of quadratic functions and the nonnegative orthant is convex. The hidden convexity of the trust-region problem with linear inequality constraints is…
We propose a new first-order optimisation algorithm to solve high-dimensional non-smooth composite minimisation problems. Typical examples of such problems have an objective that decomposes into a non-smooth empirical risk part and a…
In this study, linear second-order conformable differential equations using a proportional derivative are shown to be formally self-adjoint equations with respect to a certain inner product and the associated self-adjoint boundary…