Acta Mathematica Vietnamica
Search within journal
Volumes and issues
Issue 2, Volume 45, June 2020
2020
Special Issue: Optimization Algorithms and Some Related Problems
-
Quasi-Intersection Problems and Fixed Point Theorems Concerning Separately Scalar Weakly l.s.c and u.s.c Mappings Truong Thi Thuy Duong , Nguyen Xuan Tan PDF311-328
▸ Abstract
In this paper, we first prove a new result on quasi-variational inequality problems; then, we use it to show the existence of solutions to quasi-intersection problems. In particular, we establish several results on the existence of solutions to generalized quasi-equilibrium problems and fixed point problems concerning separately scalar weakly lower and upper semi-continuous mappings. The results in this paper generalize some well-known existence theorems from the literature. -
Well-Posedness for Set Optimization Problems Involving Set Order Relations Pham Thi Vui , Lam Quoc Anh , Rabian Wangkeeree PDF329-344
▸ Abstract
In this paper, we investigate set optimization problems with three types of set order relations. Various kinds of well-posedness for these problems and their relationship are concerned. Then, sufficient conditions for set optimization problems to be well-posed are established. Moreover, Kuratowski measure of noncompactness is applied to survey characterizations of well-posedness for set optimization problems. Furthermore, approximating solution maps and their stability are researched to propose the link between stability of the approximating problem and well-posedness of the set optimization problem. -
Separation of Convex Sets via Barrier Cones Huynh The Phung PDF345-363
▸ Abstract
A closed convex subset of a normed linear space is said to have the strong separation property if it can be strongly separated from every other disjoint, closed, and convex set by a closed hyperplane. In this paper, we give some results on the separation of convex sets noticing the role of barrier cones, develop some characterizations of subsets having the strong separation property, and apply them to consider a class of convex optimization problems. -
The Lipschitz Properties of the Value Function and the Solution Map to a Parametric Discrete Optimal Control Problem Nguyen Thi Toan , Le Quang Thuy PDF365-382
▸ Abstract
Motivated by the works of Toan and Kien (J. Nonlinear Convex Anal.12:635–650, 2011) and Thuy and Toan (Acta Math. Vietnam.43:175–199, 2018) on the stability and the solution sensitivity in parametric discrete optimal control problems, this paper is devoted to the study of the Lipschitz property of the value function and the Aubin property of the solution map to a parametric dynamic programming problem with linear constraints. By establishing abstract results on the Lipschitz property of the value function to a parametric programming and the Aubin property of the solution map to a parametric variational inequality, we obtain the Lipschitz property of the value function and the Aubin property of the solution map to a parametric discrete optimal control problem.
-
Continuity of Solution Maps to Parametric Set Optimization Problems via Parametric Equilibrium Problems Lam Quoc Anh , Nguyen Huu Danh , Tran Ngoc Tam PDF383-395
▸ Abstract
In this paper, we consider set optimization problems with respect to set less order relations. We introduce nonlinear scalarization functions for sets and study several properties of such functions. Using the concerning functions, we investigate relationships between set optimization problems and equilibrium problems. Sufficient conditions for the continuity of solution maps to such problems via equilibrium problems are established.
-
A New Linesearch Algorithm for Split Equilibrium Problems Tadchai Yuying , Somyot Plubtieng PDF397-409
▸ Abstract
In this paper, we propose a new algorithm for solving a split equilibrium problem involving nonmonotone and monotone equilibrium bifunctions in real Hilbert spaces by using a shrinking projection method with a general Armijo line search rule on the $\varepsilon$-subdifferential. We obtain a strong convergence theorem for the new algorithm. -
On Structured Distance to Uncontrollability of General Linear Retarded Systems Nguyen Khoa Son , Nguyen Thi Hong PDF411-433
▸ Abstract
In this paper, we study the robustness of controllability in the state space $M_{p}=\mathbb{K}^{n}\times L_{p}([-h,0],\mathbb{K}^{n}),$ $1 < p < \infty$, or retarded systems described by linear functional differential equations (FDE) of the form $\dot x(t)=A_{0}x(t) + {\int }_{-h}^{0}d[\eta (\theta )]x(t+\theta)+B_{0}u(t), x(t)\in \mathbb{K}^{n}, $ $u(t)\in \mathbb{K}^{m}, \mathbb{K}=\mathbb{C}$, or $\mathbb R$. Some formulas for estimating and computing the distance to uncontrollability of a controllable FDE system are obtained under the assumption that the system’s matrices $A_0, \eta, B_0$ are subjected to structured perturbations. An example is provided to illustrate the obtained results.
-
Optimality Conditions for Approximate Pareto Solutions of a Nonsmooth Vector Optimization Problem with an Infinite Number of Constraints Ta Quang Son , Nguyen Van Tuyen , Ching-Feng Wen PDF435-448
▸ Abstract
In this paper, we present some new necessary and sufficient optimality conditions in terms of Clarke subdifferentials for approximate Pareto solutions of a nonsmooth vector optimization problem which has an infinite number of constraints. As a consequence, we obtain optimality conditions for the particular cases of cone-constrained convex vector optimization problems and semidefinite vector optimization problems. Examples are given to illustrate the obtained results. -
Global Optimization from Concave Minimization to Concave Mixed Variational Inequality Le Dung Muu , Nguyen Van Quy PDF449-462
▸ Abstract
We use techniques from global optimization to develop an algorithm for finding a global solution of nonconvex mixed variational inequality problems involving separable DC cost functions. In contrast to the convex mixed variational inequality, in these problems, a local solution may not be a global one. The proposed algorithm uses the convex envelope of the separable cost function over boxes to approximate a DC cost problem with a convex cost one that can be solved by available methods. To obtain better approximate solutions, the algorithm uses an adaptive rectangular bisection which is performed only in the space of concave variables. The algorithm is applied to solve the Nash-Cournot and Bertrand equilibrium models with logarithm and quadratic concave costs. Computational results on a lot number of randomly generated data show that the proposed algorithm is efficient for these models, when the number of the concave cost functions is moderate, while the size of the model may be much larger. -
On the Maximum Independent Set Problem in Graphs of Bounded Maximum Degree Ngoc C. Lê , Trung Tran PDF463-475
▸ Abstract
We consider the maximum independent set (MIS) problem, i.e., the problem asking for a vertex subset of maximum cardinality of a graph such that no two vertices in this set are adjacent. The problem is known to be NP-hard in general, even if restricted on graphs of maximum degree at most $\Delta$ for a given integer $\Delta\ge 3$, i.e., every vertex is of degree at most $\Delta$. We try to figure out some bounded maximum degree graph classes, under which the problem can be solved in polynomial time. -
Tilt Stability for Quadratic Programs with One or Two Quadratic Inequality Constraints Nguyen Huy Chieu , Le Van Hien , Nguyen Thi Quynh Trang PDF477-499
▸ Abstract
This paper examines tilt stability for quadratic programs with one or two quadratic inequality constraints. Exploiting specific features of these problems and using some known results on tilt stability in nonlinear programming, we establish quite simple characterizations of tilt-stable local minimizers for quadratic programs with one quadratic inequality constraint under metric subregularity constraint qualification. By the same way, we also derive various tilt stability conditions for quadratic programs with two quadratic inequality constraints and satisfying certain suitable assumptions. Especially, the obtained results show that some tilt stability conditions only known to be sufficient in nonlinear programming become the necessary ones when the considered problems are quadratic programs with one or two quadratic inequality constraints.
-
Stochastic Heavy-Ball Method for Constrained Stochastic Optimization Problems Porntip Promsinchai , Ali Farajzadeh , Narin Petrot PDF501-514
▸ Abstract
In this paper, we consider a heavy-ball method for the constrained stochastic optimization problem by focusing to the situation that the constraint set is specified as the intersection of possibly finitely many constraint sets. A variant algorithm of the stochastic heavy-ball method is proposed which will be incrementally processed by both the stochastic heavy-ball method and random constraint projection simultaneously. They converge almost surely to a solution of the suggested method is exhibited. Finally, a numerical experiment is discussed.
-
Miscellaneous Applications of Certain Minimax Theorems II Biagio Ricceri PDF515-524
▸ Abstract
In this paper, we present new applications of our general minimax theorems. In particular, one of them concerns the multiplicity of global minima for the integral functional of the Calculus of Variations. -
Sectional Convexity of Epigraphs of Conjugate Mappings with Applications to Robust Vector Duality Nguyen Dinh , Dang Hai Long PDF525-553
▸ Abstract
This paper concerns the robust vector problems $$\mathrm{(RVP)}\quad \text{WMin}\left\{ F(x) : x\in C, G_{u}(x)\in -S,\forall u\in\mathcal{U}\right\}, $$ where $X, Y, Z$ are locally convex Hausdorff topological vector spaces, $K$ is a closed and convex cone in $Y$ with nonempty interior, and $S$ is a closed, convex cone in $Z$, $\mathcal{U}$ is an \textit{uncertainty set}, $F\colon X\rightarrow {Y}^\bullet,$ $G_u\colon X\rightarrow Z^\bullet$ are proper mappings for all $ u \in \mathcal U$, and $\emptyset \ne C\subset X$. Let $ A:=C\cap \left(\bigcap_{u\in\mathcal{U}}G_u^{-1}(-S)\right)$ and $I_A : X \to Y^\bullet $ be the indicator map defined by $I_A(x) = 0_Y $ if $x \in A$ and $I_A(x) = + \infty_Y$ if $ x \not\in A$. It is well-known that the epigraph of the conjugate mapping $(F+I_A)^\ast$, in general, is not a convex set. We show that, however, it is ``$k$-sectionally convex" in the sense that each section form by the intersection of $\mathrm{epi} (F+I_A)^\ast$ and any translation of a ``specific $k$-direction-subspace" is a convex subset, for any $k$ taking from $\operatorname{int} K$. The key results of the paper are the representations of the epigraph of the conjugate mapping $(F+I_A)^\ast$ via the closure of the $k$-sectionally convex hull of a union of epigraphs of conjugate mappings of mappings from a family involving the data of the problem (RVP). The results then give rise to stable robust vector/convex vector Farkas lemmas which, in turn, are used to establish new results on robust strong stable duality results for (RVP). It is shown at the end of the paper that, when specifying the result to some concrete classes of scalar robust problems (i.e., when $Y = \mathbb R$), our results cover and extend several corresponding known ones in the literature.