Results 11 to 20 of about 1,124 (204)
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
Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT [PDF]
, 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
DC programming and DCA for nonconvex optimization/ global optimization in mixed integer programming : Codes and applications [PDF]
, 2013 Based on theoretical and algorithmic tools of DC programming and DCA, the research in this thesis focus on the local and global approaches for non convex optimization and global mixed integer optimization. The thesis consists of 5 chapters. The first chapter presents fundamentals of DC programming and DCA, and techniques of Branch and Bound method (B&B)
Pham, Viet Nga
openaire +2 more sources
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
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
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
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