Polynomial optimization relaxations for generalized semi-infinite programs
From MaRDI portal
Cites work
- A branch-and-bound approach for solving a class of generalized semi-infinite programming problems
- A conceptual method for solving generalized semi-infinite programming problems via global optimization by exact discontinuous penalization
- A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods
- A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems
- A Lagrange multiplier expression method for bilevel polynomial optimization
- A lifting method for generalized semi-infinite programs based on lower level Wolfe duality
- A projected lagrangian algorithm for semi-infinite programming
- An accelerated central cutting plane algorithm for linear semi-infinite programming
- An elementary and constructive solution to Hilbert’s 17th Problem for matrices
- An exact Jacobian SDP relaxation for polynomial optimization
- An extended conjugate duality for generalized semi-infinite programming problems via a convex decomposition
- Application of general semi-infinite programming to lapidary cutting problems
- Bi-level strategies in semi-infinite programming.
- Certifying convergence of Lasserre's hierarchy via flat truncation
- Computational discretization algorithms for functional inequality constrained optimization
- Feasible method for semi-infinite programs
- Generalized semi-infinite optimization: A first order optimality condition and examples
- Generalized semi-infinite programming: a tutorial
- Generalized semi-infinite programming: numerical aspects
- Generalized semi-infinite programming: Theory and methods
- Global optimization of generalized semi-infinite programs via restriction of the right hand side
- Global optimization of semi-infinite programs via restriction of the right-hand side
- Global optimization with polynomials and the problem of moments
- Global solution of semi-infinite programs
- GloptiPoly 3: moments, optimization and semidefinite programming
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 1113627 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- Inner and outer approximations of polytopes using boxes.
- Interval methods for semi-infinite programs
- Lower level duality and the global solution of generalized semi-infinite programs
- Minimizing the sum of many rational functions
- Moment and Polynomial Optimization
- On generalized semi-infinite optimization of genetic networks
- Polynomial matrix inequality and semidefinite representation
- Rational Generalized Nash Equilibrium Problems
- Second-order optimality conditions in generalized semi-infinite programming
- Semi-infinite programming and applications to minimax problems
- 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
- Solving Semi-Infinite Optimization Problems with Interior Point Techniques
- Sum of squares methods for minimizing polynomial forms over spheres and hypersurfaces
- Sums of squares, moment matrices and optimization over polynomials
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
- The moment-SOS hierarchy. Lectures in probability, statistics, computational geometry, control and nonlinear PDEs
- Tight relaxations for polynomial optimization and Lagrange multiplier expressions
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(2)
This page was built for publication: Polynomial optimization relaxations for generalized semi-infinite programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6912331)
