A Julia Framework for Graph-Structured Nonlinear Optimization

被引:0
|
作者
Cole, David L. [1 ]
Shin, Sungho [2 ]
Zavala, Victor M. [1 ,2 ]
机构
[1] Univ Wisconsin, Dept Chem & Biol Engn, Madison, WI 53706 USA
[2] Argonne Natl Lab, Math & Comp Sci Div, Lemont, IL 60439 USA
关键词
INTERIOR-POINT METHODS; LARGE-SCALE; MODELING LANGUAGE; PARALLEL SOLUTION; DECOMPOSITION; IMPLEMENTATION; ALGORITHM; PROGRAMS;
D O I
10.1021/acs.iecr.2c01253
中图分类号
TQ [化学工业];
学科分类号
0817 ;
摘要
Graph theory provides a convenient framework for modeling and solving structured optimization problems. Under this framework, the modeler can arrange/assemble the components of an optimization model (variables, constraints, objective functions, and data) within nodes and edges of a graph, and this representation can be used to visualize, manipulate, and solve the problem. In this work, we present a Julia framework for modeling and solving graph-structured nonlinear optimization problems. Our framework integrates the modeling package Plasmo.jl (which facilitates the construction and manipulation of graph models) and the nonlinear optimization solver MadNLP.jl (which provides capabilities for exploiting graph structures to accelerate solution). We illustrate with a simple example how model construction and manipulation can be performed in an intuitive manner using Plasmo.jl and how the model structure can be exploited by MadNLP.jl. We also demonstrate the scalability of the framework by targeting a large-scale, stochastic gas network problem that contains over 1.7 million variables.
引用
收藏
页码:9366 / 9380
页数:15
相关论文
共 50 条
  • [1] Graph-Structured Nonlinear Programming: Properties and Algorithms
    Shin, Sungho
    [J]. 2023 AMERICAN CONTROL CONFERENCE, ACC, 2023, : 3136 - 3136
  • [2] GRAPH-STRUCTURED TENSOR OPTIMIZATION FOR NONLINEAR DENSITY CONTROL AND MEAN FIELD GAMES
    Ringh, Axel
    Haasler, Isabel
    Chen, Yongxin
    Karlsson, Johan
    [J]. SIAM JOURNAL ON CONTROL AND OPTIMIZATION, 2024, 62 (04) : 2176 - 2202
  • [3] EXPONENTIAL DECAY OF SENSITIVITY IN GRAPH-STRUCTURED NONLINEAR PROGRAMS
    Shin, Sungho
    Anitescu, Mihai
    Zavala, Victor M.
    [J]. SIAM JOURNAL ON OPTIMIZATION, 2022, 32 (02) : 1156 - 1183
  • [4] Graph-Structured Sparse Optimization for Connected Subgraph Detection
    Zhou, Baojian
    Chen, Feng
    [J]. 2016 IEEE 16TH INTERNATIONAL CONFERENCE ON DATA MINING (ICDM), 2016, : 709 - 718
  • [5] GRAPH-STRUCTURED SPARSE REGULARIZATION VIA CONVEX OPTIMIZATION
    Kuroda, Hiroki
    Kitahara, Daichi
    [J]. 2022 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2022, : 5538 - 5542
  • [6] A Nearly-Linear Time Framework for Graph-Structured Sparsity
    Hegde, Chinmay
    Indyk, Piotr
    Schmidt, Ludwig
    [J]. INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 37, 2015, 37 : 928 - 937
  • [7] Stochastic Iterative Hard Thresholding for Graph-structured Sparsity Optimization
    Zhou, Baojian
    Chen, Feng
    Ying, Yiming
    [J]. INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 97, 2019, 97
  • [8] Graph-Structured Visual Imitation
    Sieb, Maximilian
    Xian, Zhou
    Huang, Audrey
    Kroemer, Oliver
    Fragkiadaki, Katerina
    [J]. CONFERENCE ON ROBOT LEARNING, VOL 100, 2019, 100
  • [9] Decentralized Schemes With Overlap for Solving Graph-Structured Optimization Problems
    Shin, Sungho
    Zavala, Victor M.
    Anitescu, Mihai
    [J]. IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS, 2020, 7 (03): : 1225 - 1236
  • [10] The case for graph-structured representations
    Sanders, KE
    Kettler, BP
    Hendler, JA
    [J]. CASE-BASED REASONING RESEARCH AND DEVELOPMENT, 1997, 1266 : 245 - 254