Filters








8,806 Hits in 6.5 sec

Global optimization advances in Mixed-Integer Nonlinear Programming, MINLP, and Constrained Derivative-Free Optimization, CDFO

Fani Boukouvala, Ruth Misener, Christodoulos A. Floudas
2016 European Journal of Operational Research  
This manuscript reviews recent advances in deterministic global optimization for Mixed-Integer Nonlinear Programming (MINLP), as well as Constrained Derivative-Free Optimization (CDFO).  ...  Finally, an inclusive and complete test suite is provided for both MINLP and CDFO algorithms, which is useful for future benchmarking.  ...  The EI criterion based algorithm uses interpolating kriging surrogate models and was developed for box constrained problems.  ... 
doi:10.1016/j.ejor.2015.12.018 fatcat:jwe7b7ivrzhrjbttdl74eff2pe

Discrete Optimization for Dynamic Systems of Operations Management in Data-Driven Society

Lu Zhen, Shuaian Wang, Xiaobo Qu, Xinchang Wang
2019 Discrete Dynamics in Nature and Society  
in behavior OM for E-commerce, data-driven risk analysis and modeling for OM decisions in dynamic contexts, data-driven models for dynamic supply chain management, etc.  ...  With the rapid growth in computational technologies, including data mining technologies, discrete event simulation techniques, and intelligence algorithms, OM relies more and more on optimal solutions  ...  also wish to thank the anonymous reviewers for their careful reading of the manuscripts submitted to this special issue and their many insightful comments and suggestions.  ... 
doi:10.1155/2019/3597314 fatcat:yycr7svztjbyfmzlnv52d757ty

A kriging based method for the solution of mixed-integer nonlinear programs containing black-box functions

Eddie Davis, Marianthi Ierapetritou
2007 Journal of Global Optimization  
Response surface methodology (RSM) is then employed whereby local models are sequentially optimized to refine the problem's lower and upper bounds.  ...  models for which noisy input-output sampling data are the only information available.  ...  and Computational Toxicology Center under the GAD R 832721-010 grant.  ... 
doi:10.1007/s10898-007-9217-2 fatcat:oqvffjjoubgxxfohk364btvs2i

Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded [article]

Miten Mistry, Dimitrios Letsios, Gerhard Krennrich, Robert M. Lee, and Ruth Misener
2019 arXiv   pre-print
We develop several heuristic methods to find feasible solutions, and an exact, branch-and-bound algorithm leveraging structural properties of the gradient-boosted trees and penalty functions.  ...  Decision trees usefully represent sparse, high dimensional and noisy data.  ...  Numerical Results This section compares the Section 5 lower bounding and branch-and-bound algorithms to black-box solvers.  ... 
arXiv:1803.00952v3 fatcat:rjr4bedvdveorewzrgjlpkuvc4

Data-Driven Versus Topology-driven Irregular Computations on GPUs

Rupesh Nasre, Martin Burtscher, Keshav Pingali
2013 2013 IEEE 27th International Symposium on Parallel and Distributed Processing  
In this paper, we study data-driven and topology-driven implementations of six important graph algorithms on GPUs.  ...  Irregular algorithms are algorithms with complex main data structures such as directed and undirected graphs, trees, etc.  ...  ACKNOWLEDGMENTS This work was supported by NSF grants 0833162, 1062335, 1111766, 1141022, 1216701, 1217231 and 1218568 as well as grants and equipment donations from NVIDIA, Intel, and Qualcomm Corporations  ... 
doi:10.1109/ipdps.2013.28 dblp:conf/ipps/NasreBP13 fatcat:kmpc7fgnebfqjfjmqxhzwd4f7m

Use of Virtual Cell in Studies of Cellular Dynamics [chapter]

Boris M. Slepchenko, Leslie M. Loew
2010 International Review of Cell and Molecular Biology  
The Virtual Cell (VCell) is a unique computational environment for modeling and simulation of cell biology.  ...  The models created with VCell can range from the simple, to evaluate hypotheses or to interpret experimental data, to complex multilayered models used to probe the predicted behavior of spatially resolved  ...  Berlin Center for Cell Analysis and Modeling at the University of Connecticut Health Center.  ... 
doi:10.1016/s1937-6448(10)83001-1 pmid:20801417 pmcid:PMC3519358 fatcat:2ixz7f2xhje2lbaadxfhtfbkg4

Scanning the Issue

Azim Eskandarian
2021 IEEE transactions on intelligent transportation systems (Print)  
Furthermore, a mathematical model about the "disappear visibility" of this LiDAR under fog is statistically developed based on the collected data.  ...  Yoomak and A.  ...  The authors calculate the probability of clearing the intersection and demonstrate the effect of the traffic patterns on the optimal choice of the traffic signal control parameters.  ... 
doi:10.1109/tits.2021.3119785 fatcat:gjykhcqo3bbwdm5oilmqn7t2re

Part II. Future perspective on optimization

Ignacio E. Grossmann, Lorenz T. Biegler
2004 Computers and Chemical Engineering  
Second, we discuss logic-based optimization and its influence in both modeling and solving mixed-integer optimization problems.  ...  Third, we discuss issues and approaches related to large-scale optimization algorithms and applications.  ...  Based mostly on spatial branch and bound concepts, these algorithms have been improved by the development of new tight convex relaxations for a variety of functions, and second by more effective strategies  ... 
doi:10.1016/j.compchemeng.2003.11.006 fatcat:cbncutrwandtjdtkrsfr6poyhi

On the impact of symmetry-breaking constraints on spatial Branch-and-Bound for circle packing in a square

Alberto Costa, Pierre Hansen, Leo Liberti
2013 Discrete Applied Mathematics  
We solve the problem by means of a standard spatial Branch-and-Bound implementation, and show that our formulation improvements allow the algorithm to find very good solutions at the root node.  ...  We discuss different formulations, we analyze formulation symmetries, we propose some symmetry breaking constraints and show that not only do they tighten the convex relaxation bound, but they also ease  ...  The spatial Branch-and-Bound algorithm The sBB algorithm is an ε-approximation algorithm for solving nonconvex NLPs and Mixed-Integer Nonlinear Programs (MINLP); several variants exist, among which [2  ... 
doi:10.1016/j.dam.2012.07.020 fatcat:2q2nceq5gbbgxm62red2dagfua

Curve skeleton extraction from incomplete point cloud

Andrea Tagliasacchi, Hao Zhang, Daniel Cohen-Or
2009 ACM Transactions on Graphics  
Abstract We present an algorithm for curve skeleton extraction from imperfect point clouds where large portions of the data may be missing.  ...  Our formulation effectively utilizes normal information to compensate for the missing data and leads to robust curve skeleton computation over regions of a shape that are generally cylindrical.  ...  Acknowledgments The authors would like to thank the anonymous reviewers for their helpful comments.  ... 
doi:10.1145/1531326.1531377 fatcat:2rdk55t4mretni6tszfiipnipu

Curve skeleton extraction from incomplete point cloud

Andrea Tagliasacchi, Hao Zhang, Daniel Cohen-Or
2009 ACM SIGGRAPH 2009 papers on - SIGGRAPH '09  
Abstract We present an algorithm for curve skeleton extraction from imperfect point clouds where large portions of the data may be missing.  ...  Our formulation effectively utilizes normal information to compensate for the missing data and leads to robust curve skeleton computation over regions of a shape that are generally cylindrical.  ...  Acknowledgments The authors would like to thank the anonymous reviewers for their helpful comments.  ... 
doi:10.1145/1576246.1531377 fatcat:6ebr5la6zvhv3olkklrg6tgvou

Scanning the Issue

Azim Eskandarian
2021 IEEE transactions on intelligent transportation systems (Print)  
Velastín, and J. W. Branch This paper reviews algorithms used for the detection and tracking of motorcycles on surveillance infrastructure provided by CCTV cameras.  ...  To further stimulate the optimization of platooning, this article categorizes objectives and influencing factors and proposes metrics for the evaluation of objective attainment.  ...  , and bounding box regression; ii) a ground-region proposal network (GRPN) predicts RoIs in the horizon ground area.  ... 
doi:10.1109/tits.2021.3113361 fatcat:x2xuoh2qefcdrmqpbwqfttcvhm

Scanning the Issue

Petros Ioannou
2019 IEEE transactions on intelligent transportation systems (Print)  
The presented approach is based on a data-driven path-finding algorithm that exploits historical ship reporting systems data.  ...  And a rolling-horizon algorithm for "path-speed" simultaneously solving is also developed.  ...  The proposed approach is based on 3-D bounding boxes constructed around the vehicles automatically.  ... 
doi:10.1109/tits.2018.2885837 fatcat:crcgiff6czez3k5j4xn6mdcsj4

Learning Sparse Nonlinear Dynamics via Mixed-Integer Optimization [article]

Dimitris Bertsimas, Wes Gurnee
2022 arXiv   pre-print
We propose an exact formulation of the SINDy problem using mixed-integer optimization (MIO) to solve the sparsity constrained regression problem to provable optimality in seconds.  ...  to noise, and flexible in accommodating physical constraints.  ...  On the other hand, for small n, there are more ways to fit the data, so the bounds in the branch-and-bound tree are weaker, necessitating more node exploration.  ... 
arXiv:2206.00176v1 fatcat:cu2yhdwsmnflngsda3hqxtx3wm

A Visual Tracker Offering More Solutions

Long Zhao, Mubarak Adam Ishag Mahmoud, Honge Ren, Meng Zhu
2020 Sensors  
Channel and spatial dual attention mechanisms are employed in the target classification module to improve the discrimination of the trackers.  ...  Our proposed method has an obvious speed advantage compared with pure global searching and achieves an optimal performance on OTB2015, VOT2016, VOT2018-LT, UAV-123 and LaSOT while running at over 50 FPS  ...  Appendix B The visual target tracking method based on deep learning is theoretically a data-driven method.  ... 
doi:10.3390/s20185374 pmid:32961752 pmcid:PMC7570860 fatcat:by5c4kijffhwvop7tp6k5f5d74
« Previous Showing results 1 — 15 out of 8,806 results