A transformation-based discretization method for solving general semi-infinite optimization problems

DOI10.1007/S00186-020-00724-8MaRDI QIDQ2661756zbMATH OpenOpenAlexFDO

Authors Jan Schwientek, Tobias Seidel, Karl-Heinz Küfer

Publication date 8 April 2021

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-020-00724-8

zbMATH Keywords

discretizationcoordinate transformationsemi-infinite optimizationdesign centeringinscribing

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Semi-infinite programming (90C34)

Recommendations

• Generalized semi-infinite programming: Theory and methods
• Generalized semi-infinite programming: numerical aspects
• Discretization methods for the solution of semi-infinite programming problems
• An adaptive discretization method solving semi-infinite optimization problems with quadratic rate of convergence
• Discretization in semi-infinite programming: the rate of convergence

Cites work

• scientific article; zbMATH DE number 1186924 (Why is no real title available?)
• scientific article; zbMATH DE number 1353937 (Why is no real title available?)
• A semi-infinite approach to design centering
• Application of general semi-infinite programming to lapidary cutting problems
• 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
• Extensions of the Kuhn--Tucker Constraint Qualification to Generalized Semi-infinite Programming
• Generalized semi-infinite optimization: A first order optimality condition and examples
• Generalized semi-infinite programming: Theory and methods
• Generalized semi-infinite programming: numerical aspects
• Global optimization of generalized semi-infinite programs using disjunctive programming
• Global optimization of generalized semi-infinite programs via restriction of the right hand side
• Global solution of semi-infinite programs
• How to solve a design centering problem
• Infinitely constrained optimization problems
• On the numerical treatment of a class of semi-infinite terminal problems^∗∗Partially supported by the german research society (DFG)$ef:
• Second-order optimality conditions in generalized semi-infinite programming
• Segmentation and recovery of superquadrics
• Semi-infinite programming
• Some outer approximation methods for semi-infinite optimization problems
• The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming

Cited in

(9)

• Discretization methods for the solution of semi-infinite programming problems
• scientific article; zbMATH DE number 1786295 (Why is no real title available?)
• On the convergence of local solutions for the method quADAPT
• Adaptive discretization-based algorithms for semi-infinite programs with unbounded variables
• Solving continuous set covering problems by means of semi-infinite optimization. With an application in product portfolio optimization
• scientific article; zbMATH DE number 4143777 (Why is no real title available?)
• Problem-based optimal scenario generation and reduction in stochastic programming
• Convex semi-infinite programming algorithms with inexact separation oracles
• Global optimization of generalized semi-infinite programs using disjunctive programming

This page was built for publication: A transformation-based discretization method for solving general semi-infinite optimization problems

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