Results 1 to 10 of about 1,124 (204)
A New Global Optimization Algorithm for Solving a Class of Nonconvex Programming Problems [PDF]
Journal of Applied Mathematics, 2014 A new two-part parametric linearization technique is proposed globally to a class of nonconvex programming problems (NPP). Firstly, a two-part parametric linearization method is adopted to construct the underestimator of objective and constraint ...
Xue-Gang Zhou, Bing-Yuan Cao
doaj +5 more sources
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 ...
Wan-Chi Siu +2 more
exaly +10 more sources
A Global Optimization Algorithm for Generalized Quadratic Programming [PDF]
Journal of Applied Mathematics, 2013 We present a global optimization algorithm for solving generalized quadratic programming (GQP), that is, nonconvex quadratic programming with nonconvex quadratic constraints.
Hongwei Jiao, Yongqiang Chen
doaj +2 more sources
IEEE Access, 2022 The branch and bound (BB) algorithm is widely used to obtain the global solution of mixed-integer linear programming (MILP) problems. On the other hand, when the traditional BB structure is directly used to solve nonconvex mixed-integer nonlinear ...
Reinaldo T. Zoppei +4 more
doaj +1 more source
An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs [PDF]
Journal of Global Optimization, 2019 In this work, we develop an adaptive, multivariate partitioning algorithm for solving mixed-integer nonlinear programs (MINLP) with multi-linear terms to global optimality. This iterative algorithm primarily exploits the advantages of piecewise polyhedral relaxation approaches via disjunctive formulations to solve MINLPs to global optimality in ...
Harsha Nagarajan +4 more
openaire +3 more sources
Energy Reports, 2021 Hydropower is one of the significant renewable energy resources. It is regularly requested at peak time steps to meet the load requirements of power systems resources allocation. Therefore, modeling the optimal operation of hydropower systems to maximize
Yin Fang +5 more
doaj +1 more source
Energies, 2023 The design of an efficient energy management system (EMS) for monopolar DC networks with high penetration of photovoltaic generation plants is addressed in this research through a convex optimization point of view.
Oscar Danilo Montoya +2 more
doaj +1 more source
An ADMM-based SQP method for separably smooth nonconvex optimization
Journal of Inequalities and Applications, 2020 This work is about a splitting approach for solving separably smooth nonconvex linearly constrained optimization problems. Based on the ideas from two classical methods, namely the sequential quadratic programming (SQP) and the alternating direction ...
Meixing Liu, Jinbao Jian
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.
Juan P. Ruiz, Ignacio E. Grossmann
openaire +1 more source
BMC Bioinformatics, 2012 Background The estimation of parameter values for mathematical models of biological systems is an optimization problem that is particularly challenging due to the nonlinearities involved.
Miró Anton +4 more
doaj +1 more source