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 +4 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 +5 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 +2 more sources
TOMLAB - Large-Scale Optimization in MATLAB, LABVIEW and .NET
, 2007 The optimization environment TOMLAB, http://tomopt.com, has seen a tremendous growth during the last years. Most state-of-the-art optimization software has been hooked up, e.g. KNITRO, SNOPT and CONOPT for large-scale nonlinear programming, and CPLEX and
Holmström, Kenneth,, Edvall, Marcus,
core +5 more sources
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
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
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
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
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
Reformulations of mathematical programming problems as linear complementarity problems [PDF]
, 1982 A family of complementarity problems are defined as extensions of the well known Linear Complementarity Problem (LCP). These are (i.) Second Linear Complementarity Problem (SLCP) which is an LCP extended by introducing further equality restrictions and ...
Mitra, G, Judice, JJ
core +4 more sources