Results 21 to 30 of about 17,775 (173)
Energy efficiency optimization in MIMO interference channels: A successive pseudoconvex approximation approach [PDF]
, 2018 In this paper, we consider the (global and sum) energy efficiency optimization problem in downlink multi-input multi-output multi-cell systems, where all users suffer from multi-user interference.
Chatzinotas, Symeon +3 more
core +2 more sources
Using convex nonlinear relaxations in the global optimization of nonconvex generalized disjunctive programs [PDF]
Computers & Chemical Engineering, 2013 In this paper we present a framework to generate tight convex relaxations for nonconvex generalized disjunctive programs. The proposed methodology builds on our recent work on bilinear and concave generalized disjunctive programs for which tight linear relaxations can be generated, and extends its application to nonlinear relaxations.
Ruiz, Juan P., Grossmann, Ignacio E.
openaire +1 more source
A Global Optimization Approach for Solving Generalized Nonlinear Multiplicative Programming Problem
Abstract and Applied Analysis, 2014 This paper presents a global optimization algorithm for solving globally the generalized nonlinear multiplicative programming (MP) with a nonconvex constraint set.
Lin-Peng Yang +2 more
doaj +1 more source
Abstract and Applied Analysis, 2013 Combined heat and power dynamic economic emission dispatch (CHPDEED) problem is a complicated nonlinear constrained multiobjective optimization problem with nonconvex characteristics.
A. M. Elaiw, X. Xia, A. M. Shehata
doaj +1 more source
Robust Adaptive Beamformer Based on Constant Modulus Penalty Criteria
International Journal of Aerospace Engineering, 2023 In this study, a robust adaptive beamformer based on constant modulus (CM) criteria is developed to improve the robustness of the array beamforming, which is a reconstructing minimal optimization for solving the mismatch problem of weight vector caused ...
Chuanhui Hao, Bin Zhang, Xubao Sun
doaj +1 more source
A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs [PDF]
Journal of Global Optimization, 2019 This paper proposes a joint decomposition method that combines La- grangian decomposition and generalized Benders decomposition, to efficiently solve multiscenario nonconvex mixed-integer nonlinear programming (MINLP) problems to global optimality, without the need for explicit branch and bound search.
Emmanuel Ogbe, Xiang Li
openaire +4 more sources
Linear decomposition approach for a class of nonconvex programming problems
Journal of Inequalities and Applications, 2017 This paper presents a linear decomposition approach for a class of nonconvex programming problems by dividing the input space into polynomially many grids.
Peiping Shen, Chunfeng Wang
doaj +1 more source
Energies, 2022 Distributed generation (DG) aims to generate part of the required electrical energy on a small scale closer to the places of consumption. Integration of DG into an existing electric distribution network (EDN) has technical, economic, and environmental ...
Luis A. Gallego Pareja +2 more
doaj +1 more source
IEEE Open Journal of Signal Processing, 2020 In this paper, we consider a class of nonconvex complex quadratic programming (CQP) problems, which find a broad spectrum of signal processing applications.
Cheng Lu, Ya-Feng Liu, Jing Zhou
doaj +1 more source
A Status Report on Conflict Analysis in Mixed Integer Nonlinear Programming
, 2019 Mixed integer nonlinear programs (MINLPs) are arguably among the hardest optimization problems, with a wide range of applications. MINLP solvers that are based on linear relaxations and spatial branching work similar as mixed integer programming (MIP ...
A Forsgren +37 more
core +1 more source