Using Discrete and Continuous Models to Solve Nanoporous Flow Optimization Problems

被引:0
|
作者
Boggs, Paul T. [1 ]
Gay, David M. [2 ]
Nash, Stephen G. [3 ]
机构
[1] Sandia Natl Labs, Livermore, CA 94551 USA
[2] AMPL Optimizat Inc, Albuquerque, NM 87108 USA
[3] George Mason Univ, Fairfax, VA 22030 USA
关键词
Multigrid Optimization; Multilevel Optimization; Nonlinear Optimization; Complex Hierarchical Optimization; ALGORITHMS; NETWORK;
D O I
10.4208/nmtma.2015.w13si
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We consider using a discrete network model in combination with continuous nonlinear optimization models to solve the problem of optimizing channels in nanoporous materials. The problem and the hierarchical optimization algorithm are described in [2]. A key feature of the model is the fact that we use the edges of the finite element grid as the locations of the channels. The focus here is on the use of the discrete model within that algorithm. We develop several approximations to the relevant flow and a greedy algorithm for quickly generating a "good" tree connecting all of the nodes in the finite-element mesh to a designated root node. We also consider Metropolis-Hastings (MH) improvements to the greedy result. We consider both a regular triangulation and a Delaunay triangulation of the region, and present some numerical results.
引用
收藏
页码:149 / 167
页数:19
相关论文
共 50 条
  • [1] Using Continuous Action Spaces to Solve Discrete Problems
    van Hasselt, Hado
    Wiering, Marco A.
    [J]. IJCNN: 2009 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS, VOLS 1- 6, 2009, : 1144 - +
  • [2] Combining discrete and continuous optimization to solve kinodynamic motion planning problems
    Chantal Landry
    Wolfgang Welz
    Matthias Gerdts
    [J]. Optimization and Engineering, 2016, 17 : 533 - 556
  • [3] Combining discrete and continuous optimization to solve kinodynamic motion planning problems
    Landry, Chantal
    Welz, Wolfgang
    Gerdts, Matthias
    [J]. OPTIMIZATION AND ENGINEERING, 2016, 17 (03) : 533 - 556
  • [4] Models to classify the difficulty of genetic algorithms to solve continuous optimization problems
    Rodriguez-Maya, Noel E.
    Flores, Juan J.
    Verel, Sebastien
    Graff, Mario
    [J]. NATURAL COMPUTING, 2024, 23 (02) : 431 - 451
  • [5] Kernel Technology to Solve Discrete Optimization Problems
    Sergienko I.V.
    Shylo V.P.
    [J]. Cybernetics and Systems Analysis, 2017, 53 (6) : 884 - 892
  • [6] A hybrid discrete particle swarm optimization algorithm to solve flow shop scheduling problems
    Chandrasekaran, S.
    Ponnambalam, S. G.
    Suresh, R. K.
    Vijayakumar, N.
    [J]. 2006 IEEE CONFERENCE ON CYBERNETICS AND INTELLIGENT SYSTEMS, VOLS 1 AND 2, 2006, : 528 - +
  • [7] Efficient hybrid algorithms to solve mixed discrete-continuous optimization problems A comparative study
    Liu, Dianzi
    Liu, Chengyang
    Zhang, Chuanwei
    Xu, Chao
    Du, Ziliang
    Wan, Zhiqiang
    [J]. ENGINEERING COMPUTATIONS, 2018, 35 (02) : 979 - 1002
  • [8] Continuous approaches to discrete optimization problems
    Pardalos, PM
    [J]. NONLINEAR OPTIMIZATION AND APPLICATIONS, 1996, : 313 - 325
  • [9] CONTINUOUS MODELING OF DISCRETE OPTIMIZATION PROBLEMS
    FUKAO, T
    HARADA, T
    WU, JJ
    [J]. LECTURE NOTES IN CONTROL AND INFORMATION SCIENCES, 1992, 180 : 165 - 174
  • [10] Discrete and Continuous Models for Partitioning Problems
    Jan Lellmann
    Björn Lellmann
    Florian Widmann
    Christoph Schnörr
    [J]. International Journal of Computer Vision, 2013, 104 : 241 - 269