• Nonlinear Functional Analysis and Applications
• /
• v.26 no.3
• /
• pp.451-474
• /
• 2021

In this paper, we investigate a hybrid algorithm for finding zeros of the sum of maximal monotone operators and Lipschitz continuous monotone operators which is also a common fixed point problem for finite family of relatively quasi-nonexpansive mappings and split feasibility problem in uniformly convex real Banach spaces which are also uniformly smooth. The iterative algorithm employed in this paper is design in such a way that it does not require prior knowledge of operator norm. We prove a strong convergence result for approximating the solutions of the aforementioned problems and give applications of our main result to minimization problem and convexly constrained linear inverse problem.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.10
• /
• pp.1000-1006
• /
• 2007

This paper presents an LMI-based method to design a saturated state-feedback $H_2$ controller for uncertain systems with actuator saturation. Specifically, the paper proposes a sufficient condition such that the system under norm-bounded uncertainties and actuator saturation is asymptotically stable and the $H_2$-norm of the system has an upper-bound. The resulting condition is further utilized to solve a convex optimization problem specified in the context of $H_2$-norm minimization, whose solution yields a saturated $H_2$ controller. A numerical example is presented to show the effectiveness of the proposed method.

• Nonlinear Functional Analysis and Applications
• /
• v.28 no.4
• /
• pp.1051-1067
• /
• 2023

In this paper, an algorithm for approximating zeros of sum of three monotone operators is introduced and its convergence properties are studied in the setting of 2-uniformly convex and uniformly smooth Banach spaces. Unlike the existing algorithms whose step-sizes usually depend on the knowledge of the operator norm or Lipschitz constant, a nice feature of the proposed algorithm is the fact that it requires only a diminishing and non-summable step-size to obtain strong convergence of the iterates to a solution of the problem. Finally, the proposed algorithm is implemented in the setting of a classical Banach space to support the theory established.

• Nonlinear Functional Analysis and Applications
• /
• v.27 no.1
• /
• pp.149-167
• /
• 2022

In this paper, we propose a viscosity iterative algorithm for approximating a common solution of finite family of variational inequality problem and fixed point problem for finite family of multi-valued type-one demicontractive mappings in real Hilbert spaces. A strong convergence result of the aforementioned problems were proved and some consequences of our result was also displayed. In addition, we discuss an application of our main result to convex minimization problem. The result presented in this article complements and extends many recent results in literature.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.30 no.10 s.253
• /
• pp.1249-1254
• /
• 2006

Existing adaptive observers may cause the parameter drifts due to disturbances even if state estimation errors remain small. To avoid the drift phenomena in the presence of bounded disturbances, several robust adaptive observers have been introduced addressing bounds in state and parameter estimates. However, it is not easy for these observers to manipulate the size of the bounds with the selection of the observer gain. In order to reduce estimation errors, this paper introduces the (equation omitted) gain minimization problem in the adaptive observer structure, which minimizes the (equation omitted) gain between disturbances and estimation errors. The stability condition of the adaptive observer is reformulated as a linear matrix inequality, and the observer gain is optimally chosen by solving the convex optimization problem. The estimation performance is demonstrated through a numerical example.

• Journal of Communications and Networks
• /
• v.14 no.2
• /
• pp.140-150
• /
• 2012

In this paper, we investigate the optimal packet scheduling problem in a two-user multiple access communication system, where the transmitters are able to harvest energy from the nature. Under a deterministic system setting, we assume that the energy harvesting times and harvested energy amounts are known before the transmission starts. For the packet arrivals, we assume that packets have already arrived and are ready to be transmitted at the transmitter before the transmission starts. Our goal is to minimize the time by which all packets from both users are delivered to the destination through controlling the transmission powers and transmission rates of both users. We first develop a generalized iterative backward waterfilling algorithm to characterize the maximum departure region of the transmitters for any given deadline T. Then, based on the sequence of maximum departure regions at energy arrival instants, we decompose the transmission completion time minimization problem into convex optimization problems and solve the overall problem efficiently.

• ETRI Journal
• /
• v.39 no.1
• /
• pp.13-20
• /
• 2017

A method is proposed for scheduling sensor accesses to the shared network in a networked control system. The proposed method determines the access order in which the sensors are granted medium access through minimization of the state estimation error covariance. Solving the problem by evaluating the error covariance for each possible ordered set of sensors is not practical for large systems. Therefore, a convex optimization problem is proposed, which yields approximate yet acceptable results. A state estimator is designed for the augmented system resulting from the incorporation of the optimally chosen communication sequence in the plant dynamics. A car suspension system simulation is conducted to test the proposed method. The results show promising improvement in the state estimation performance by reducing the estimation error norm compared to round-robin scheduling.

• Journal of Communications and Networks
• /
• v.18 no.2
• /
• pp.173-181
• /
• 2016

In this paper, we address a new robust optimization problem in a multiuser multiple-input single-output broadcasting system with simultaneous wireless information and power transmission, where a multi-antenna base station (BS) sends energy and information simultaneously to multiple users equipped with a single antenna. Assuming that perfect channel-state information (CSI) for all channels is not available at the BS, the uncertainty of the CSI is modeled by an Euclidean ball-shaped uncertainty set. To optimally design transmit beamforming weights and receive power splitting, an average total transmit power minimization problem is investigated subject to the individual harvested power constraint and the received signal-to-interference-plus-noise ratio constraint at each user. Due to the channel uncertainty, the original problem becomes a homogeneous quadratically constrained quadratic problem, which is NP-hard. The original design problem is reformulated to a relaxed semidefinite program, and then two different approaches based on convex programming are proposed, which can be solved efficiently by the interior point algorithm. Numerical results are provided to validate the robustness of the proposed algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.8
• /
• pp.2722-2742
• /
• 2014

We propose methods of linear transceiver design for two different power constraints, sum relay power constraint and per relay power constraint, which determine signal processing matrices such as base station (BS) transmitter, relay precoders and user receivers to minimize sum mean square error (SMSE) for multi-relay multi-user (MRMU) networks. However, since the formulated problem is non-convex one which is hard to be solved, we suboptimally solve the problems by defining convex subproblems with some fixed variables. We adopt iterative sequential designs of which each iteration stage corresponds to each subproblem. Karush-Kuhn-Tucker (KKT) theorem and SMSE duality are employed as specific methods to solve subproblems. The numerical results verify that the proposed methods provide comparable performance to that of a full relay cooperation bound (FRCB) method while outperforming the simple amplify-and-forward (SAF) and minimum mean square error (MMSE) relaying in terms of not only SMSE, but also the sum rate.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.5
• /
• pp.1940-1949
• /
• 2015

This paper presents an Enhanced Particle Swarm Optimization (EPSO) to solve short-term hydrothermal scheduling (STHS) problem with non-convex fuel cost function and a variety of operational constraints related to hydro and thermal units. The operators of the conventional PSO are dynamically controlled using exponential functions for better exploration and exploitation of the search space. The overall methodology efficiently regulates the velocity of particles during their flight and results in substantial improvement in the conventional PSO. The effectiveness of the proposed method has been tested for STHS of two standard test generating systems while considering several operational constraints like system power balance constraints, power generation limit constraints, reservoir storage volume limit constraints, water discharge rate limit constraints, water dynamic balance constraints, initial and end reservoir storage volume limit constraints, valve-point loading effect, etc. The application results show that the proposed EPSO method is capable to solve the hard combinatorial constraint optimization problems very efficiently.