Loading…
GPU-based Graver Basis Extraction for Nonlinear Integer Optimization
Nonlinear integer programs involve optimizing nonlinear objectives with variables restricted to integer values, and have widespread applications in areas such as resource allocation and portfolio selection. One approach to solving these problems is the augmentation procedure, which iteratively refin...
Saved in:
Published in: | arXiv.org 2024-12 |
---|---|
Main Authors: | , , |
Format: | Article |
Language: | English |
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | |
---|---|
cites | |
container_end_page | |
container_issue | |
container_start_page | |
container_title | arXiv.org |
container_volume | |
creator | Liu, Wenbo Wang, Akang Yang, Wenguo |
description | Nonlinear integer programs involve optimizing nonlinear objectives with variables restricted to integer values, and have widespread applications in areas such as resource allocation and portfolio selection. One approach to solving these problems is the augmentation procedure, which iteratively refines a feasible solution by identifying augmenting steps from the Graver Basis--a set of test directions. While this method guarantees termination in polynomially many steps, computing the Graver Basis exactly is known to be \(\mathcal{NP}\)-hard. To address this computational challenge, we propose Multi-start Augmentation via Parallel Extraction (MAPLE), a GPU-based heuristic designed to efficiently approximate the Graver Basis. MAPLE extracts test directions by optimizing non-convex continuous problems, leveraging first-order methods to enable parallelizable implementation. The resulting set of directions is then used in multiple augmentations, each seeking to improve the solution's optimality. The proposed approach has three notable characteristics: (i) independence from general-purpose solvers, while ensuring guaranteed feasibility of solutions; (ii) high computational efficiency, achieved through GPU-based parallelization; (iii) flexibility in handling instances with shared constraint matrices but varying objectives and right-hand sides. Empirical evaluations on QPLIB benchmark instances demonstrate that MAPLE delivers performance comparable to state-of-the-art solvers in terms of solution quality, while achieving significant gains in computational efficiency. These results highlight MAPLE's potential as an effective heuristic for solving nonlinear integer programs in practical applications. |
format | article |
fullrecord | <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_3147263976</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3147263976</sourcerecordid><originalsourceid>FETCH-proquest_journals_31472639763</originalsourceid><addsrcrecordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mRwcQ8I1U1KLE5NUXAvSixLLVJwSizOLFZwrSgpSkwuyczPU0jLL1Lwy8_LycxLTSxS8MwrSU0HKvMvKMnMzaxKBCnhYWBNS8wpTuWF0twMym6uIc4eugVF-YWlqcUl8Vn5pUV5QKl4Y0MTcyMzY0tzM2PiVAEAA8Y6XQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>3147263976</pqid></control><display><type>article</type><title>GPU-based Graver Basis Extraction for Nonlinear Integer Optimization</title><source>ProQuest - Publicly Available Content Database</source><creator>Liu, Wenbo ; Wang, Akang ; Yang, Wenguo</creator><creatorcontrib>Liu, Wenbo ; Wang, Akang ; Yang, Wenguo</creatorcontrib><description>Nonlinear integer programs involve optimizing nonlinear objectives with variables restricted to integer values, and have widespread applications in areas such as resource allocation and portfolio selection. One approach to solving these problems is the augmentation procedure, which iteratively refines a feasible solution by identifying augmenting steps from the Graver Basis--a set of test directions. While this method guarantees termination in polynomially many steps, computing the Graver Basis exactly is known to be \(\mathcal{NP}\)-hard. To address this computational challenge, we propose Multi-start Augmentation via Parallel Extraction (MAPLE), a GPU-based heuristic designed to efficiently approximate the Graver Basis. MAPLE extracts test directions by optimizing non-convex continuous problems, leveraging first-order methods to enable parallelizable implementation. The resulting set of directions is then used in multiple augmentations, each seeking to improve the solution's optimality. The proposed approach has three notable characteristics: (i) independence from general-purpose solvers, while ensuring guaranteed feasibility of solutions; (ii) high computational efficiency, achieved through GPU-based parallelization; (iii) flexibility in handling instances with shared constraint matrices but varying objectives and right-hand sides. Empirical evaluations on QPLIB benchmark instances demonstrate that MAPLE delivers performance comparable to state-of-the-art solvers in terms of solution quality, while achieving significant gains in computational efficiency. These results highlight MAPLE's potential as an effective heuristic for solving nonlinear integer programs in practical applications.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Computational efficiency ; Feasibility ; Graphics processing units ; Heuristic ; Integer programming ; Optimization ; Resource allocation ; Solvers</subject><ispartof>arXiv.org, 2024-12</ispartof><rights>2024. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.proquest.com/docview/3147263976?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>780,784,25753,37012,44590</link.rule.ids></links><search><creatorcontrib>Liu, Wenbo</creatorcontrib><creatorcontrib>Wang, Akang</creatorcontrib><creatorcontrib>Yang, Wenguo</creatorcontrib><title>GPU-based Graver Basis Extraction for Nonlinear Integer Optimization</title><title>arXiv.org</title><description>Nonlinear integer programs involve optimizing nonlinear objectives with variables restricted to integer values, and have widespread applications in areas such as resource allocation and portfolio selection. One approach to solving these problems is the augmentation procedure, which iteratively refines a feasible solution by identifying augmenting steps from the Graver Basis--a set of test directions. While this method guarantees termination in polynomially many steps, computing the Graver Basis exactly is known to be \(\mathcal{NP}\)-hard. To address this computational challenge, we propose Multi-start Augmentation via Parallel Extraction (MAPLE), a GPU-based heuristic designed to efficiently approximate the Graver Basis. MAPLE extracts test directions by optimizing non-convex continuous problems, leveraging first-order methods to enable parallelizable implementation. The resulting set of directions is then used in multiple augmentations, each seeking to improve the solution's optimality. The proposed approach has three notable characteristics: (i) independence from general-purpose solvers, while ensuring guaranteed feasibility of solutions; (ii) high computational efficiency, achieved through GPU-based parallelization; (iii) flexibility in handling instances with shared constraint matrices but varying objectives and right-hand sides. Empirical evaluations on QPLIB benchmark instances demonstrate that MAPLE delivers performance comparable to state-of-the-art solvers in terms of solution quality, while achieving significant gains in computational efficiency. These results highlight MAPLE's potential as an effective heuristic for solving nonlinear integer programs in practical applications.</description><subject>Computational efficiency</subject><subject>Feasibility</subject><subject>Graphics processing units</subject><subject>Heuristic</subject><subject>Integer programming</subject><subject>Optimization</subject><subject>Resource allocation</subject><subject>Solvers</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><recordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mRwcQ8I1U1KLE5NUXAvSixLLVJwSizOLFZwrSgpSkwuyczPU0jLL1Lwy8_LycxLTSxS8MwrSU0HKvMvKMnMzaxKBCnhYWBNS8wpTuWF0twMym6uIc4eugVF-YWlqcUl8Vn5pUV5QKl4Y0MTcyMzY0tzM2PiVAEAA8Y6XQ</recordid><startdate>20241218</startdate><enddate>20241218</enddate><creator>Liu, Wenbo</creator><creator>Wang, Akang</creator><creator>Yang, Wenguo</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20241218</creationdate><title>GPU-based Graver Basis Extraction for Nonlinear Integer Optimization</title><author>Liu, Wenbo ; Wang, Akang ; Yang, Wenguo</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_31472639763</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Computational efficiency</topic><topic>Feasibility</topic><topic>Graphics processing units</topic><topic>Heuristic</topic><topic>Integer programming</topic><topic>Optimization</topic><topic>Resource allocation</topic><topic>Solvers</topic><toplevel>online_resources</toplevel><creatorcontrib>Liu, Wenbo</creatorcontrib><creatorcontrib>Wang, Akang</creatorcontrib><creatorcontrib>Yang, Wenguo</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>ProQuest Central Essentials</collection><collection>AUTh Library subscriptions: ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>ProQuest - Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Liu, Wenbo</au><au>Wang, Akang</au><au>Yang, Wenguo</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>GPU-based Graver Basis Extraction for Nonlinear Integer Optimization</atitle><jtitle>arXiv.org</jtitle><date>2024-12-18</date><risdate>2024</risdate><eissn>2331-8422</eissn><abstract>Nonlinear integer programs involve optimizing nonlinear objectives with variables restricted to integer values, and have widespread applications in areas such as resource allocation and portfolio selection. One approach to solving these problems is the augmentation procedure, which iteratively refines a feasible solution by identifying augmenting steps from the Graver Basis--a set of test directions. While this method guarantees termination in polynomially many steps, computing the Graver Basis exactly is known to be \(\mathcal{NP}\)-hard. To address this computational challenge, we propose Multi-start Augmentation via Parallel Extraction (MAPLE), a GPU-based heuristic designed to efficiently approximate the Graver Basis. MAPLE extracts test directions by optimizing non-convex continuous problems, leveraging first-order methods to enable parallelizable implementation. The resulting set of directions is then used in multiple augmentations, each seeking to improve the solution's optimality. The proposed approach has three notable characteristics: (i) independence from general-purpose solvers, while ensuring guaranteed feasibility of solutions; (ii) high computational efficiency, achieved through GPU-based parallelization; (iii) flexibility in handling instances with shared constraint matrices but varying objectives and right-hand sides. Empirical evaluations on QPLIB benchmark instances demonstrate that MAPLE delivers performance comparable to state-of-the-art solvers in terms of solution quality, while achieving significant gains in computational efficiency. These results highlight MAPLE's potential as an effective heuristic for solving nonlinear integer programs in practical applications.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | EISSN: 2331-8422 |
ispartof | arXiv.org, 2024-12 |
issn | 2331-8422 |
language | eng |
recordid | cdi_proquest_journals_3147263976 |
source | ProQuest - Publicly Available Content Database |
subjects | Computational efficiency Feasibility Graphics processing units Heuristic Integer programming Optimization Resource allocation Solvers |
title | GPU-based Graver Basis Extraction for Nonlinear Integer Optimization |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T13%3A44%3A02IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=GPU-based%20Graver%20Basis%20Extraction%20for%20Nonlinear%20Integer%20Optimization&rft.jtitle=arXiv.org&rft.au=Liu,%20Wenbo&rft.date=2024-12-18&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E3147263976%3C/proquest%3E%3Cgrp_id%3Ecdi_FETCH-proquest_journals_31472639763%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=3147263976&rft_id=info:pmid/&rfr_iscdi=true |