Solving generalized semi-infinite programs by reduction to simpler problems
From MaRDI portal
Publication:4656056
DOI10.1080/02331930410001661190zbMath1079.90144OpenAlexW2037458160MaRDI QIDQ4656056
No author found.
Publication date: 8 March 2005
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331930410001661190
DiscretizationPenalty MethodsParametric ProgrammingSemi-infinite Programming With Variable Index Sets
Related Items (8)
Saddle points theory of two classes of augmented Lagrangians and its applications to generalized semi-infinite programming ⋮ New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm ⋮ Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development ⋮ Outer approximation schemes for generalized semi-infinite variational inequality problems ⋮ Necessary optimality conditions for nonsmooth generalized semi-infinite programming problems ⋮ On numerical optimization theory of infinite kernel learning ⋮ Lower level duality and the global solution of generalized semi-infinite programs ⋮ \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
Cites Work
- Unnamed Item
- A branch-and-bound approach for solving a class of generalized semi-infinite programming problems
- First-order optimality conditions in generalized semi-infinite programming
- On the reduction of nonconvex problems of generalized semi-infinite mathematical programming to convex problems of semi-infinite programming
- Generalized semi-infinite programming: numerical aspects
- Semi-Infinite Programming: Theory, Methods, and Applications
- Directional differentiability of the optimal value function in a nonlinear programming problem
- Calmness and Exact Penalization
- Solving Semi-Infinite Optimization Problems with Interior Point Techniques
- Second order optimality conditions for generalized semi-infinite programming problems
This page was built for publication: Solving generalized semi-infinite programs by reduction to simpler problems
