Results 1 to 10 of about 34,499 (189)
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
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
openaire +6 more sources
A Global Optimization Algorithm for Signomial Geometric Programming Problem
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
A Global Optimization Algorithm for Generalized Quadratic Programming
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 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 +2 more sources
Journal of the Egyptian Mathematical Society, 2015 This article has been withdrawn at the request of the author(s) and/or editor. The Publisher apologizes for any inconvenience this may cause. The full Elsevier Policy on Article Withdrawal can be found at http://www.elsevier.com/locate/withdrawalpolicy.
Leslous, Fadila +3 more
openaire +2 more sources
Global optimization of mixed-integer nonlinear programs with SCIP 8 [PDF]
Journal of Global Optimization, 2023 For over 10 years, the constraint integer programming framework SCIP has been extended by capabilities for the solution of convex and nonconvex mixed-integer nonlinear programs (MINLPs).
Ksenia Bestuzheva +5 more
semanticscholar +1 more source
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
Certifiably Optimal Outlier-Robust Geometric Perception: Semidefinite Relaxations and Scalable Global Optimization [PDF]
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2021 We propose the first general and scalable framework to design certifiable algorithms for robust geometric perception in the presence of outliers. Our first contribution is to show that estimation using common robust costs, such as truncated least squares
Heng Yang, L. Carlone
semanticscholar +1 more source
Mixed Monotonic Programming for Fast Global Optimization [PDF]
IEEE Transactions on Signal Processing, 2019 While globally optimal solutions to many convex programs can be computed efficiently in polynomial time, this is, in general, not possible for nonconvex optimization problems. Therefore, locally optimal approaches or other efficient suboptimal heuristics
Bho Matthiesen +3 more
semanticscholar +1 more source