Saved in:
Bibliographic Details
Main Authors: Hu, Xiaomeng, Nie, Jiawang, Zhong, Suhan
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2502.01075
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866908463100067840
author Hu, Xiaomeng
Nie, Jiawang
Zhong, Suhan
author_facet Hu, Xiaomeng
Nie, Jiawang
Zhong, Suhan
contents This paper studies generalized semi-infinite programs (GSIPs) defined with polyhedral parameter sets. Assume these GSIPs are given by polynomials. We propose a new approach to solve them as a disjunctive program. This approach is based on the Karush-Kuhn-Tucker (KKT) conditions of the robust constraint and a technique called partial Lagrange multiplier expressions. We summarize a semidefinite algorithm and study its convergence properties. Numerical experiments are given to show the efficiency of our method. In addition, we checked its performance in gemstone cutting and robust control applications.
format Preprint
id arxiv_https___arxiv_org_abs_2502_01075
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle A global approach for generalized semi-infinte programs with polyhedral parameter sets
Hu, Xiaomeng
Nie, Jiawang
Zhong, Suhan
Optimization and Control
This paper studies generalized semi-infinite programs (GSIPs) defined with polyhedral parameter sets. Assume these GSIPs are given by polynomials. We propose a new approach to solve them as a disjunctive program. This approach is based on the Karush-Kuhn-Tucker (KKT) conditions of the robust constraint and a technique called partial Lagrange multiplier expressions. We summarize a semidefinite algorithm and study its convergence properties. Numerical experiments are given to show the efficiency of our method. In addition, we checked its performance in gemstone cutting and robust control applications.
title A global approach for generalized semi-infinte programs with polyhedral parameter sets
topic Optimization and Control
url https://arxiv.org/abs/2502.01075