Pages that link to "Item:Q3058519"
From MaRDI portal
The following pages link to A “Joint+Marginal” Approach to Parametric Polynomial Optimization (Q3058519):
Displaying 18 items.
- An efficient, strongly polynomial, \(\varepsilon\)-approximation parametric optimization scheme (Q290269) (← links)
- Distributionally robust mixed integer linear programs: persistency models with applications (Q296964) (← links)
- Min-max and robust polynomial optimization (Q652661) (← links)
- Approximating Pareto curves using semidefinite relaxations (Q1785276) (← links)
- A ``joint + marginal'' heuristic for 0/1 programs (Q1928265) (← links)
- An algorithm for semi-infinite polynomial optimization (Q1935882) (← links)
- Distributionally robust polynomial chance-constraints under mixture ambiguity sets (Q2220666) (← links)
- Computing generalized Nash equilibria by polynomial programming (Q2392820) (← links)
- Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems (Q2796798) (← links)
- A “Joint+Marginal” Approach in Optimization (Q2802528) (← links)
- Least Squares Approximation to the Distribution of Project Completion Times with Gaussian Uncertainty (Q2957465) (← links)
- A New Look at Nonnegativity on Closed Sets and Polynomial Optimization (Q3105778) (← links)
- Semidefinite Approximations of Projections and Polynomial Images of SemiAlgebraic Sets (Q3451759) (← links)
- Time-Varying Semidefinite Programs (Q4958555) (← links)
- Optimizing simultaneously over the numerator and denominator polynomials in the Youla-Kuc/spl caron/era parametrization (Q5274150) (← links)
- A new scheme for approximating the weakly efficient solution set of vector rational optimization problems (Q6109053) (← links)
- A utopia point method-based robust vector polynomial optimization scheme (Q6154404) (← links)
- Generalized semi-infinite polynomial optimization and semidefinite programming relaxations (Q6650707) (← links)
