Existence of Robust Optimal Solutions for Uncertain Convex Polynomial Optimization Problems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3843508 (Why is no real title available?)
- scientific article; zbMATH DE number 1201576 (Why is no real title available?)
- scientific article; zbMATH DE number 732325 (Why is no real title available?)
- scientific article; zbMATH DE number 7753348 (Why is no real title available?)
- A Frank--Wolfe type theorem for convex polynomial programs
- A Frank-Wolfe type theorem for nondegenerate polynomial programs
- An easy path to convex analysis and applications
- Characterizing robust solution sets of convex programs under data uncertainty
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Convex Analysis
- Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems
- Ehresmann fibrations and Palais-Smale conditions for morphisms of Finsler manifolds
- Existence of Pareto solutions for vector polynomial optimization problems with constraints
- Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data
- Global Optimization of Polynomials Using the Truncated Tangency Variety and Sums of Squares
- How to deal with the unbounded in optimization: Theory and algorithms
- Local minimizers of semi-algebraic functions from the viewpoint of tangencies
- Multi-objective convex polynomial optimization and semidefinite programming relaxations
- On a Frank-Wolfe type theorem in cubic optimization
- On extensions of the Frank-Wolfe theorems
- On nonsmooth optimality theorems for robust optimization problems
- On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems
- On robust optimization. Relations between scalar robust optimization and unconstrained multicriteria optimization
- On the existence of Pareto solutions for polynomial vector optimization problems
- On the solution existence and stability of polynomial optimization problems
- On the solution existence and stability of quadratically constrained nonconvex quadratic programs
- On the solution existence to convex polynomial programs and its applications
- Optimality and duality for robust multiobjective optimization problems
- Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
- Robust SOS-convex polynomial optimization problems: exact SDP relaxations
- Robust convex optimization
- Robust duality for generalized convex programming problems under data uncertainty
- Robust optimization
- Semianalytic and subanalytic sets
- Solvability of a regular polynomial vector optimization problem without convexity
- Solving polynomial optimization problems via the truncated tangency variety and sums of squares
- Tangencies and polynomial optimization
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- Theory and applications of robust optimization
- Weighted robust optimality of convex optimization problems with data uncertainty
This page was built for publication: Existence of Robust Optimal Solutions for Uncertain Convex Polynomial Optimization Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6922458)
