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

DOI10.1007/S00186-022-00792-YMaRDI QIDQ2168050zbMATH OpenOpenAlexFDO

Authors Daniel Jungen, Hatim Djelassi, Alexander Mitsos

Publication date 31 August 2022

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

semi-infinite programmingunboundedadaptive discretization

Mathematics Subject Classification ID

Semi-infinite programming (90C34)

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

Cites work

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

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

Describes a project that uses

Uses Software

• libALE
• GAMS

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)