Results 1 to 10 of about 7,641,552 (201)
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
A Global Optimization Algorithm for Signomial Geometric Programming Problem [PDF]
Abstract and Applied Analysis, 2014 This paper presents a global optimization algorithm for solving the signomial geometric programming (SGP) problem. In the algorithm, by the straight forward algebraic manipulation of terms and by utilizing a transformation of variables, the initial ...
Xue-Ping Hou +2 more
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
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
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
Systems Science & Control Engineering, 2020 We propose a new two-level vertex-searching algorithm framework that finds a global optimal solution to the continuous bilevel linear fractional programming problem over a compact polyhedron, in which both the upper and the lower objectives are linear ...
Hui-Ju Chen
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