An Approach to Forming and Managing a Portfolio of Financial Securities by Small and Medium Price-Taking Traders in a Stock Exchange systems of linear equations and inequalities of a balance kind, calculating saddle points is reduced to solving linear programming problems forming a dual ... AS Bel...
Formulations of these problems are given, and the uniqueness of their solutions is proved. An iterative method for solving inverse problems of forming structural components is proposed. Numerical solutions of these problems are obtained using a finite-element method....
In both of our beamforming approaches, the worst case of the total/individual relay transmit power and the worst case of the receive QoS in the norm-bound-determined set are found by solving several sub-problems, which are shown to have closed-form solutions. It is shown that the solutions...
The optimal power allocation scheme is obtained by solving a convex optimization problem aiming at minimizing network energy consumption with guaranteed quality of service (QoS) for both PU and SUs. Simulation results show that with the consideration of overheads, circuit power, and energy costs for...
In this game on polyhedra of disjoint player strategies, described by systems of linear equations and inequalities of a balance kind, calculating saddle points is reduced to solving linear programming problems forming a dual pair.doi:10.1007/978-3-319-18161-5_22Alexander S. Belenky...
In this game on polyhedra of disjoint player strategies, described by systems of linear equations and inequalities of a balance kind, calculating saddle points is reduced to solving linear programming problems forming a dual pair.doi:10.1007/978-3-319-18161-5_22Alexander S. Belenky...
variational inequalityIn this paper we propose a new method of solving the contact problems which arise during sheet metal forming simulations using a static-explicit finite-element method (FEM) code. We have identified the factors which determine the contact status of the nodes which have very ...
solving a sequence of “dual” min-max power problems. Relying on the S-procedure and the linear matrix inequality representation for the cone of Lorentz-positive maps (LPMs), respectively, two designs, which are referred to as Robust-SP and Robust-LPM, are proposed to efficiently solve such...
In both of our beamforming approaches, the worst case of the total/individual relay transmit power and the worst case of the receive QoS in the norm-bound-determined set are found by solving several sub-problems, which are shown to have closed-form solutions. It is shown that the solutions...
To better analyze the problem (P4), we summarize the detailed process for solving (P4) in Algorithm 1. 3.2. Optimization Algorithm Description In this subsection, we propose an Altmin-1 algorithm for solving (P4) under perfect CSI. Then, Algorithm 1 is summarized as follows: Algorithm 1:...