scholarly journals Complete solutions and triality theory to a nonconvex optimization problem with double-well potential in $\mathbb{R}^n $

2013 ◽  
Vol 3 (2) ◽  
pp. 271-282 ◽  
Author(s):  
Daniel Morales-Silva ◽  
◽  
David Yang Gao
2020 ◽  
Vol 2020 ◽  
pp. 1-15
Author(s):  
Tao Hong ◽  
Geng-xin Zhang

The research of improving the secrecy capacity (SC) of wireless communication system using artificial noise (AN) is one of the classic models in the field of physical layer security communication. In this paper, we consider the peak-to-average power ratio (PAPR) problem in this AN-aided model. A power allocation algorithm for AN subspaces is proposed to solve the nonconvex optimization problem of PAPR. This algorithm utilizes a series of convex optimization problems to relax the nonconvex optimization problem in a convex way based on fractional programming, difference of convex (DC) functions programming, and nonconvex quadratic equality constraint relaxation. Furthermore, we also derive the SC of the proposed signal under the condition of the AN-aided model with a finite alphabet and the nonlinear high-power amplifiers (HPAs). Simulation results show that the proposed algorithm reduces the PAPR value of transmit signal to improve the efficiency of HPA compared with benchmark AN-aided secure communication signals in the multiple-input single-output (MISO) model.


2021 ◽  
Vol 6 (11) ◽  
pp. 12321-12338
Author(s):  
Yanfei Chai ◽  

<abstract><p>This paper deals with the robust strong duality for nonconvex optimization problem with the data uncertainty in constraint. A new weak conjugate function which is abstract convex, is introduced and three kinds of robust dual problems are constructed to the primal optimization problem by employing this weak conjugate function: the robust augmented Lagrange dual, the robust weak Fenchel dual and the robust weak Fenchel-Lagrange dual problem. Characterizations of inequality (1.1) according to robust abstract perturbation weak conjugate duality are established by using the abstract convexity. The results are used to obtain robust strong duality between noncovex uncertain optimization problem and its robust dual problems mentioned above, the optimality conditions for this noncovex uncertain optimization problem are also investigated.</p></abstract>


2016 ◽  
Vol 2016 ◽  
pp. 1-8
Author(s):  
Mio Horai ◽  
Hideo Kobayashi ◽  
Takashi G. Nitta

We propose a new method for the specific nonlinear and nonconvex global optimization problem by using a linear relaxation technique. To simplify the specific nonlinear and nonconvex optimization problem, we transform the problem to the lower linear relaxation form, and we solve the linear relaxation optimization problem by the Branch and Bound Algorithm. Under some reasonable assumptions, the global convergence of the algorithm is certified for the problem. Numerical results show that this method is more efficient than the previous methods.


Sign in / Sign up

Export Citation Format

Share Document