Results 21 to 30 of about 7,288,186 (192)
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 0029
openaire +5 more sources
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
Pooling problem: Alternate formulations and solution methods [PDF]
, 2004 Copyright @ 2004 INFORMSThe pooling problem, which is fundamental to the petroleum industry, describes a situation in which products possessing different attribute qualities are mixed in a series of pools in such a way that the attribute qualities of the
Brimberg, J +9 more
core +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
Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT
, 2022 Different versions of polyhedral outer approximation are used by many algorithms for mixed-integer nonlinear programming (MINLP). While it has been demonstrated that such methods work well for convex MINLP, extending them to solve nonconvex problems has ...
Lundell, Andreas, Kronqvist, Jan,
core +1 more source
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
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
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
Journal of the Egyptian Mathematical Society, 2015 This article has been withdrawn at the request of the author(s) and/or editor. The Publisher apologizes for any inconvenience this may cause. The full Elsevier Policy on Article Withdrawal can be found at http://www.elsevier.com/locate/withdrawalpolicy.
Leslous, Fadila +3 more
openaire +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