Adaptive discretization-based algorithms for semi-infinite programs with unbounded variables

DOI10.1007/S00186-022-00792-YzbMATH Open1500.90076OpenAlexW4285799561MaRDI QIDQ2168050FDOQ2168050

Authors: Daniel Jungen, Hatim Djelassi, Alexander Mitsos 

Publication date: 31 August 2022

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-022-00792-y

Recommendations

• Global solution of semi-infinite programs
• An adaptive discretization method solving semi-infinite optimization problems with quadratic rate of convergence
• A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs
• Two algorithm frameworks based on discretization method and local reduction for semi-infinite programming
• Relaxation-Based Bounds for Semi-Infinite Programs

zbMATH Keywords

semi-infinite programmingunboundedadaptive discretization

Mathematics Subject Classification ID

Semi-infinite programming (90C34)

Cites Work

• Numerical Optimization
• Global solution of bilevel programs with a nonconvex inner program
• Infinitely constrained optimization problems
• Bi-level strategies in semi-infinite programming.
• Semi-Infinite Programming: Theory, Methods, and Applications
• Semi-infinite programming
• Application of general semi-infinite programming to lapidary cutting problems
• Title not available (Why is that?)
• Global solution of semi-infinite programs
• Discretization in semi-infinite programming: the rate of convergence
• A hybrid LP/NLP paradigm for global optimization relaxations
• Generalized semi-infinite programming: Theory and methods
• Generalized semi-infinite programming: a tutorial
• Discretization methods for the solution of semi-infinite programming problems
• Interval methods for semi-infinite programs
• Global optimization of semi-infinite programs via restriction of the right-hand side
• The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
• Relaxation-Based Bounds for Semi-Infinite Programs
• A nonconvex max-min problem
• Global optimization of generalized semi-infinite programs via restriction of the right hand side
• A feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programming
• A transformation-based discretization method for solving general semi-infinite optimization problems
• A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs
• Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints
• Global solution of semi-infinite programs with existence constraints
• An adaptive discretization method solving semi-infinite optimization problems with quadratic rate of convergence

Cited In (2)

• On the convergence of local solutions for the method quADAPT
• A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs

Uses Software

• GAMS
• libALE

This page was built for publication: Adaptive discretization-based algorithms for semi-infinite programs with unbounded variables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2168050)