Solving generalized semi-infinite programs by reduction to simpler problems

DOI10.1080/02331930410001661190MaRDI QIDQ4656056zbMATH OpenOpenAlexFDO

Authors

Publication date 8 March 2005

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331930410001661190

zbMATH Keywords

DiscretizationPenalty MethodsParametric ProgrammingSemi-infinite Programming With Variable Index Sets

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Semi-infinite programming (90C34)

Recommendations

• Generalized semi-infinite programming: Theory and methods
• The semismooth approach for semi-infinite programming under the reduction ansatz
• How to solve a semi-infinite optimization problem
• Generalized semi-infinite programming: numerical aspects
• scientific article; zbMATH DE number 1994002

Cites work

• scientific article; zbMATH DE number 1845876 (Why is no real title available?)
• A branch-and-bound approach for solving a class of generalized semi-infinite programming problems
• Calmness and Exact Penalization
• Directional differentiability of the optimal value function in a nonlinear programming problem
• First-order optimality conditions in generalized semi-infinite programming
• Generalized semi-infinite programming: numerical aspects
• On the reduction of nonconvex problems of generalized semi-infinite mathematical programming to convex problems of semi-infinite programming
• Second order optimality conditions for generalized semi-infinite programming problems
• Semi-Infinite Programming: Theory, Methods, and Applications
• Solving Semi-Infinite Optimization Problems with Interior Point Techniques

Cited in

(9)

• New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm
• \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
• Necessary optimality conditions for nonsmooth generalized semi-infinite programming problems
• Generalized semi-infinite programming: The symmetric reduction ansatz
• Outer approximation schemes for generalized semi-infinite variational inequality problems
• Saddle points theory of two classes of augmented Lagrangians and its applications to generalized semi-infinite programming
• Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development
• On numerical optimization theory of infinite kernel learning
• Lower level duality and the global solution of generalized semi-infinite programs

This page was built for publication: Solving generalized semi-infinite programs by reduction to simpler problems

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