Generalized semi-infinite programming: numerical aspects
From MaRDI portal
Recommendations
- Generalized semi-infinite programming: Theory and methods
- Generalized semi-infinite programming: a tutorial
- On generalized semi-infinite programming. (With comments and rejoinder).
- The semismooth approach for semi-infinite programming under the reduction ansatz
- Global solution of semi-infinite programs
Cites work
- A branch-and-bound approach for solving a class of generalized semi-infinite programming problems
- Disjunctive optimization: Critical point theory
- First-order optimality conditions in generalized semi-infinite programming
- Generalized semi-infinite optimization: A first order optimality condition and examples
- Generalized semi-infinite programming: Theory and methods
- On stability and stationary points in nonlinear optimization
- 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 for generalized semi-infinite programming problems
- Semi-Infinite Programming: Theory, Methods, and Applications
Cited in
(41)- An efficient algorithm for - convex semi-infinite programming problems
- scientific article; zbMATH DE number 1994002 (Why is no real title available?)
- Recent advances in nonconvex semi-infinite programming: applications and algorithms
- Generalized corner optimal solution for LSIP: existence and numerical computation
- scientific article; zbMATH DE number 1186924 (Why is no real title available?)
- Application of general semi-infinite programming to lapidary cutting problems
- Generalized Levitin-Polyak well-posedness for generalized semi-infinite programs
- Outer approximation schemes for generalized semi-infinite variational inequality problems
- Connections between generalized, inexact and semi-infinite linear programming
- On constraint qualifications in nonsmooth optimization.
- A transformation-based discretization method for solving general semi-infinite optimization problems
- A conceptual method for solving generalized semi-infinite programming problems via global optimization by exact discontinuous penalization
- On generalized semi-infinite optimization and bilevel optimization
- Feasible method for generalized semi-infinite programming
- On vector generalized semi-infinite programming
- Solving generalized semi-infinite programs by reduction to simpler problems
- On the use of augmented Lagrangians in the solution of generalized semi-infinite min-max problems
- A penalty function method for the principal-agent problem with an infinite number of incentive-compatibility constraints under moral hazard
- Generalized semi-infinite programming: a tutorial
- First order optimality conditions for generalized semi-infinite programming problems
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development
- A penalty method for topology optimization subject to a pointwise state constraint
- Global optimization of generalized semi-infinite programs via restriction of the right hand side
- Nonlinear robust optimization via sequential convex bilevel programming
- On linear-quadratic elliptic control problems of semi-infinite type
- Two algorithm frameworks based on discretization method and local reduction for semi-infinite programming
- Semi-Infinite Programming: Theory, Methods, and Applications
- A lifting method for generalized semi-infinite programs based on lower level Wolfe duality
- An extended conjugate duality for generalized semi-infinite programming problems via a convex decomposition
- Equivalent properties of global weak sharp minima with applications
- Scenario approximation of robust and chance-constrained programs
- How to solve a semi-infinite optimization problem
- Polynomial optimization relaxations for generalized semi-infinite programs
- Towards rigorous robust optimal control via generalized high-order moment expansion
- Discretization algorithms for generalized semi-infinite programs with coupling equality constraints under local solution stability
- Lower level duality and the global solution of generalized semi-infinite programs
- Semidefinite relaxations for semi-infinite polynomial programming
- Problem-based optimal scenario generation and reduction in stochastic programming
- Global optimization of generalized semi-infinite programs using disjunctive programming
- On generalized semi-infinite programming. (With comments and rejoinder).
- A global approach for generalized semi-infinite programs with polyhedral parameter sets
This page was built for publication: Generalized semi-infinite programming: numerical aspects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2720274)
