Results 11 to 20 of about 605 (168)
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 +3 more sources
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
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
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
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
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
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 +4 more sources
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