Related papers: Efficiency for multitime vector variational proble…
This paper deals with optimal transmission switching (OTS) problems involving discrete binary decisions about network topology and non-convex power flow constraints. We adopt a semidefinite programming formulation for the OPF problem which,…
The multi-objective optimization is to optimize several objective functions over a common feasible set. Since the objectives usually do not share a common optimizer, people often consider (weakly) Pareto points. This paper studies…
We distinguish two kinds of piecewise linear functions and provide an interesting representation for a piecewise linear function between two normed spaces. Based on such a representation, we study a fully piecewise linear vector…
Value-at-risk (VaR), also known as quantile, is a crucial risk measure in finance and other fields. However, optimizing VaR metrics in Markov decision processes (MDPs) is challenging because VaR is non-additive and the traditional dynamic…
Recently, there has been increasing interest and progress in improvising the approximation algorithm for well-known NP-Complete problems, particularly the approximation algorithm for the Vertex-Cover problem. Here we have proposed a…
We consider the problem of optimal portfolio selection under forward investment performance criteria in an incomplete market. Given multiple traded assets, the prices of which depend on multiple observable stochastic factors, we construct a…
Quasi-periodic solutions with multiple base frequencies exhibit the feature of $2\pi$-periodicity with respect to each of the hyper-time variables. However, it remains a challenge work, due to the lack of effective solution methods, to…
This article presents a mathematical analysis and numerical strategies for solving the optimization problem of minimizing the quadratic function $J(P) = \text{Tr}(BP)- \frac{1}{2} \text{Tr}(A P A P)$, where $A,B \in \mathbb R^{M \times…
Large-scale Markov decision processes (MDPs) require planning algorithms with runtime independent of the number of states of the MDP. We consider the planning problem in MDPs using linear value function approximation with only weak…
The Fast Fourier Transform (FFT) is widely used in applications such as MRI, CT, and interferometry; however, because of its dependence on uniformly sampled data, it requires the use of gridding techniques for practical implementation. The…
In this paper we deal with parabolic variational inequalities of Navier-Stokes type with time-dependent constraints on velocity fields, including gradient constraint case. One of the objectives of this paper is to propose a weak variational…
Vertex Subset Problems (VSPs) are a class of combinatorial optimization problems on graphs where the goal is to find a subset of vertices satisfying a predefined condition. Two prominent approaches for solving VSPs are dynamic programming…
A particular instance of the Shortest Vector Problem (SVP) appears in the context of Compute-and-Forward. Despite the NP-hardness of the SVP, we will show that this certain instance can be solved in complexity order $O(n\psi\log(n\psi))$…
The paper focuses on a multidimensional optimization problem, which is formulated in terms of tropical mathematics and consists in minimizing a nonlinear objective function subject to linear inequality constraints. To solve the problem, we…
We study more general variational problems on time scales. Previous results are generalized by proving necessary optimality conditions for (i) variational problems involving delta derivatives of more than the first order, and (ii) problems…
In this paper, we propose two projection dynamical systems for solving inverse quasi-variational inequality problems in finite-dimensional Hilbert spaces-one ensuring finite-time stability and the other guaranteeing fixed-time stability. We…
A lattice is the integer span of some linearly independent vectors. Lattice problems have many significant applications in coding theory and cryptographic systems for their conjectured hardness. The Shortest Vector Problem (SVP), which is…
The VertexCover problem is proven to be computationally hard in different ways: It is NP-complete to find an optimal solution and even NP-hard to find an approximation with reasonable factors. In contrast, recent experiments suggest that on…
The present paper represents a continuation of our previous one. There, a continuous dependence result for the solution of an elliptic variational-hemivariational inequality was obtained and then used to prove the existence of optimal pairs…
We aim to prove a unique solvability of an initial-boundary value problem (IBVP) for a time-fractional wave equation in a rectangular domain. We exploit the spectral expansion method as the main tool and used the solution to Cauchy problems…