Results 21 to 30 of about 34,499 (189)
Machine Learning-Based Offloading Strategy for Lightweight User Mobile Edge Computing Tasks
Complexity, 2021 This paper presents an in-depth study and analysis of offloading strategies for lightweight user mobile edge computing tasks using a machine learning approach.
Shuchen Zhou, Waqas Jadoon, Junaid Shuja
doaj +1 more source
Exploiting Sparsity in SDP Relaxation for Harmonic Balance Method
IEEE Access, 2020 In general, harmonic balance problems are extremely nonconvex and difficult to solve. A convex relaxation in the form of semidefinite programming has attracted a lot of attention recently, as it finds a global solution with high accuracy without the need
Cheng-Hsiung Yang, Ben Shen Deng
doaj +1 more source
Journal of the Mechanical Behavior of Materials, 2015 This paper introduces constructing convex-relaxed programs for nonconvex optimization problems. Branch-and-bound algorithms are convex-relaxation-based techniques.
Keller André A.
doaj +1 more source
The Reformulation-based aGO Algorithm for Solving Nonconvex MINLP Problems – Some Improvements
Chemical Engineering Transactions, 2013 The a-reformulation (aR) technique can be used to transform any nonconvex twice-differentiable mixed-integer nonlinear programming problem to a convex relaxed form.
A. Lundell, T. Westerlund
doaj +1 more source
Two-Channel Linear Phase FIR QMF Bank Minimax Design via Global Nonconvex Optimization Programming [PDF]
IEEE Transactions on Signal Processing, 2010 In this correspondence, a two-channel linear phase finite-impulse-response (FIR) quadrature mirror filter (QMF) bank minimax design problem is formulated as a nonconvex optimization problem so that a weighted sum of the maximum amplitude distortion of the filter bank, the maximum passband ripple magnitude and the maximum stopband ripple magnitude of ...
Bingo Wing-Kuen Ling +5 more
openaire +3 more sources
Outer approximation for global optimization of mixed-integer quadratic bilevel problems
Mathematical programming, 2021 Bilevel optimization problems have received a lot of attention in the last years and decades. Besides numerous theoretical developments there also evolved novel solution algorithms for mixed-integer linear bilevel problems and the most recent algorithms ...
Thomas Kleinert +2 more
semanticscholar +1 more source
An Improved Geometric Programming Approach for Optimization of Biochemical Systems
Journal of Applied Mathematics, 2014 This paper proposes an improved geometric programming approach to address the optimization of biochemical systems. In the proposed method we take advantage of a special and interesting class of nonlinear kinetic models known as generalized mass action ...
Gongxian Xu, Lei Wang
doaj +1 more source
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
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