A global approach for generalized semi-infinite programs with polyhedral parameter sets
From MaRDI portal
Cites work
- A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods
- A projected lagrangian algorithm for semi-infinite programming
- Adaptive Approximations and Exact Penalization for the Solution of Generalized Semi-infinite Min-Max Problems
- An implementation of a discretization method for semi-infinite programming
- Application of general semi-infinite programming to lapidary cutting problems
- Basic concepts of global optimization
- Bi-level strategies in semi-infinite programming.
- Certifying convergence of Lasserre's hierarchy via flat truncation
- Computing a global optimal solution to a design centering problem
- Convergent Algorithms for a Class of Convex Semi-infinite Programs
- Convex generalized Nash equilibrium problems and polynomial optimization
- Convex semi-infinite programming algorithms with inexact separation oracles
- Data-driven robust optimization using deep neural networks
- Distributionally robust optimization with moment ambiguity sets
- Extensions of the Kuhn--Tucker Constraint Qualification to Generalized Semi-infinite Programming
- Feasible method for generalized semi-infinite programming
- Generalized semi-infinite optimization: A first order optimality condition and examples
- Generalized semi-infinite programming: a tutorial
- Generalized semi-infinite programming: numerical aspects
- Global optimization of generalized semi-infinite programs via restriction of the right hand side
- Global optimization with polynomials and the problem of moments
- GloptiPoly 3: moments, optimization and semidefinite programming
- Granularity for mixed-integer polynomial optimization problems
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- Infinitely constrained optimization problems
- Moment and Polynomial Optimization
- On generalized semi-infinite optimization and bilevel optimization
- On generalized semi-infinite optimization of genetic networks
- On linear and linearized generalized semi-infinite optimization problems
- Optimality conditions for semi-infinite and generalized semi-infinite programs via lower order exact penalty functions
- Polynomial optimization relaxations for generalized semi-infinite programs
- Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints
- Rational Generalized Nash Equilibrium Problems
- Robustness and regularization of support vector machines
- Second-order optimality conditions in generalized semi-infinite programming
- Semi-Infinite Programming: Theory, Methods, and Applications
- Semidefinite relaxations for semi-infinite polynomial programming
- Sensitivity analysis of the value function for parametric mathematical programs with equilibrium constraints
- Set-valued analysis
- The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets
- Tight relaxations for polynomial optimization and Lagrange multiplier expressions
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
This page was built for publication: A global approach for generalized semi-infinite programs with polyhedral parameter sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6936060)
